./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_cnstr.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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 13:25:48,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 13:25:48,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 13:25:48,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 13:25:48,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 13:25:48,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 13:25:48,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 13:25:48,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 13:25:48,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 13:25:48,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 13:25:48,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 13:25:48,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 13:25:48,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 13:25:48,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 13:25:48,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 13:25:48,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 13:25:48,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 13:25:48,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 13:25:48,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 13:25:48,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 13:25:48,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 13:25:48,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 13:25:48,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 13:25:48,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 13:25:48,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 13:25:48,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 13:25:48,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 13:25:48,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 13:25:48,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 13:25:49,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 13:25:49,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 13:25:49,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 13:25:49,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 13:25:49,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 13:25:49,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 13:25:49,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 13:25:49,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 13:25:49,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 13:25:49,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 13:25:49,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 13:25:49,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 13:25:49,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 13:25:49,042 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 13:25:49,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 13:25:49,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 13:25:49,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 13:25:49,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 13:25:49,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 13:25:49,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 13:25:49,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 13:25:49,047 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 13:25:49,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 13:25:49,048 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 13:25:49,049 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 13:25:49,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 13:25:49,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 13:25:49,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 13:25:49,049 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 13:25:49,050 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 13:25:49,050 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 13:25:49,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 13:25:49,050 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 13:25:49,050 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 13:25:49,050 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 13:25:49,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 13:25:49,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 13:25:49,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 13:25:49,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:25:49,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 13:25:49,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 13:25:49,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 13:25:49,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 13:25:49,052 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 13:25:49,052 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 13:25:49,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 13:25:49,053 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 13:25:49,053 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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2023-02-14 13:25:49,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 13:25:49,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 13:25:49,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 13:25:49,362 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 13:25:49,365 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 13:25:49,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-14 13:25:50,443 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 13:25:50,618 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 13:25:50,619 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-14 13:25:50,633 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcb4aae8/23813d7c35d149c2bf3029f5f9f4dd3b/FLAGfbd4b846c [2023-02-14 13:25:50,647 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcb4aae8/23813d7c35d149c2bf3029f5f9f4dd3b [2023-02-14 13:25:50,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 13:25:50,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 13:25:50,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 13:25:50,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 13:25:50,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 13:25:50,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:25:50" (1/1) ... [2023-02-14 13:25:50,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0b276f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:50, skipping insertion in model container [2023-02-14 13:25:50,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:25:50" (1/1) ... [2023-02-14 13:25:50,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 13:25:50,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 13:25:50,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:25:50,994 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 13:25:51,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 13:25:51,077 INFO L208 MainTranslator]: Completed translation [2023-02-14 13:25:51,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51 WrapperNode [2023-02-14 13:25:51,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 13:25:51,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 13:25:51,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 13:25:51,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 13:25:51,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,145 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2023-02-14 13:25:51,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 13:25:51,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 13:25:51,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 13:25:51,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 13:25:51,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,181 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 13:25:51,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 13:25:51,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 13:25:51,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 13:25:51,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (1/1) ... [2023-02-14 13:25:51,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 13:25:51,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:25:51,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 13:25:51,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 13:25:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 13:25:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 13:25:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 13:25:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 13:25:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 13:25:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 13:25:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 13:25:51,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 13:25:51,361 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 13:25:51,378 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 13:25:51,856 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 13:25:51,862 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 13:25:51,863 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 13:25:51,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:25:51 BoogieIcfgContainer [2023-02-14 13:25:51,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 13:25:51,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 13:25:51,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 13:25:51,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 13:25:51,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:25:50" (1/3) ... [2023-02-14 13:25:51,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa2bd34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:25:51, skipping insertion in model container [2023-02-14 13:25:51,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:25:51" (2/3) ... [2023-02-14 13:25:51,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa2bd34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:25:51, skipping insertion in model container [2023-02-14 13:25:51,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:25:51" (3/3) ... [2023-02-14 13:25:51,871 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2023-02-14 13:25:51,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 13:25:51,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-02-14 13:25:51,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 13:25:51,928 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;@2362b048, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 13:25:51,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-02-14 13:25:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 13:25:51,935 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:51,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 13:25:51,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:51,940 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-14 13:25:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:51,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280674281] [2023-02-14 13:25:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:52,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280674281] [2023-02-14 13:25:52,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280674281] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:52,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:52,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:25:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285166571] [2023-02-14 13:25:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:52,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:25:52,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:52,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:25:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:52,151 INFO L87 Difference]: Start difference. First operand has 123 states, 66 states have (on average 2.121212121212121) internal successors, (140), 122 states have internal predecessors, (140), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:52,289 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2023-02-14 13:25:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:25:52,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-02-14 13:25:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:52,299 INFO L225 Difference]: With dead ends: 166 [2023-02-14 13:25:52,299 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 13:25:52,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:52,303 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:52,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 106 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 13:25:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2023-02-14 13:25:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 118 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-14 13:25:52,335 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 3 [2023-02-14 13:25:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:52,335 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-14 13:25:52,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-14 13:25:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 13:25:52,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:52,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 13:25:52,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 13:25:52,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:52,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-14 13:25:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:52,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481082087] [2023-02-14 13:25:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:52,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:52,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481082087] [2023-02-14 13:25:52,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481082087] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:52,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:52,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 13:25:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756659783] [2023-02-14 13:25:52,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:52,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:25:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:52,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:25:52,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:52,451 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:52,600 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2023-02-14 13:25:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:25:52,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2023-02-14 13:25:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:52,609 INFO L225 Difference]: With dead ends: 160 [2023-02-14 13:25:52,609 INFO L226 Difference]: Without dead ends: 160 [2023-02-14 13:25:52,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:52,615 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 125 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:52,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 110 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-14 13:25:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2023-02-14 13:25:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 2.0) internal successors, (130), 116 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2023-02-14 13:25:52,630 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 3 [2023-02-14 13:25:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:52,631 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2023-02-14 13:25:52,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2023-02-14 13:25:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:25:52,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:52,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:52,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 13:25:52,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:52,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2023-02-14 13:25:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:52,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668567753] [2023-02-14 13:25:52,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:52,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668567753] [2023-02-14 13:25:52,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668567753] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:52,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:52,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:25:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839082225] [2023-02-14 13:25:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:52,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:25:52,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:52,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:25:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:25:52,736 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:52,916 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2023-02-14 13:25:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:25:52,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 13:25:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:52,919 INFO L225 Difference]: With dead ends: 146 [2023-02-14 13:25:52,920 INFO L226 Difference]: Without dead ends: 146 [2023-02-14 13:25:52,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:25:52,927 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 233 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:52,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 75 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:25:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-14 13:25:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2023-02-14 13:25:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2023-02-14 13:25:52,946 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 7 [2023-02-14 13:25:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:52,947 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2023-02-14 13:25:52,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2023-02-14 13:25:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 13:25:52,948 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:52,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:52,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 13:25:52,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2023-02-14 13:25:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:52,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033092520] [2023-02-14 13:25:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:53,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:53,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033092520] [2023-02-14 13:25:53,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033092520] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:53,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:53,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:25:53,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511574315] [2023-02-14 13:25:53,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:53,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:25:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:53,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:25:53,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:25:53,079 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:53,285 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2023-02-14 13:25:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:25:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 13:25:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:53,286 INFO L225 Difference]: With dead ends: 227 [2023-02-14 13:25:53,286 INFO L226 Difference]: Without dead ends: 227 [2023-02-14 13:25:53,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:25:53,287 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 267 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:53,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 124 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:25:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-14 13:25:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 172. [2023-02-14 13:25:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6985294117647058) internal successors, (231), 171 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2023-02-14 13:25:53,295 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 7 [2023-02-14 13:25:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:53,295 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2023-02-14 13:25:53,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2023-02-14 13:25:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 13:25:53,296 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:53,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:53,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 13:25:53,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1237592114, now seen corresponding path program 1 times [2023-02-14 13:25:53,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:53,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82667230] [2023-02-14 13:25:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:53,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82667230] [2023-02-14 13:25:53,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82667230] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:53,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:53,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:25:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200471116] [2023-02-14 13:25:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:53,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:25:53,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:53,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:25:53,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:53,360 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:53,375 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2023-02-14 13:25:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:25:53,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-02-14 13:25:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:53,377 INFO L225 Difference]: With dead ends: 186 [2023-02-14 13:25:53,377 INFO L226 Difference]: Without dead ends: 186 [2023-02-14 13:25:53,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:53,378 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:53,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:25:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-14 13:25:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2023-02-14 13:25:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6838235294117647) internal successors, (229), 171 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2023-02-14 13:25:53,392 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 10 [2023-02-14 13:25:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:53,394 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2023-02-14 13:25:53,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2023-02-14 13:25:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:25:53,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:53,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:53,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 13:25:53,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -288934911, now seen corresponding path program 1 times [2023-02-14 13:25:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:53,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956679710] [2023-02-14 13:25:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:53,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956679710] [2023-02-14 13:25:53,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956679710] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:53,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:53,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:25:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836755841] [2023-02-14 13:25:53,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:53,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:25:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:53,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:25:53,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:53,453 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:53,463 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2023-02-14 13:25:53,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:25:53,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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 14 [2023-02-14 13:25:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:53,464 INFO L225 Difference]: With dead ends: 175 [2023-02-14 13:25:53,465 INFO L226 Difference]: Without dead ends: 175 [2023-02-14 13:25:53,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:53,466 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:53,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:25:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-14 13:25:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-14 13:25:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 139 states have (on average 1.669064748201439) internal successors, (232), 174 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2023-02-14 13:25:53,475 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 14 [2023-02-14 13:25:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:53,475 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2023-02-14 13:25:53,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2023-02-14 13:25:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 13:25:53,476 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:53,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:53,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 13:25:53,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:53,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2023-02-14 13:25:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:53,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982764299] [2023-02-14 13:25:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:53,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:53,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982764299] [2023-02-14 13:25:53,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982764299] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:53,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:53,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:25:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671118429] [2023-02-14 13:25:53,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:53,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:25:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:25:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:53,527 INFO L87 Difference]: Start difference. First operand 175 states and 232 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:53,535 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2023-02-14 13:25:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:25:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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 14 [2023-02-14 13:25:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:53,537 INFO L225 Difference]: With dead ends: 177 [2023-02-14 13:25:53,537 INFO L226 Difference]: Without dead ends: 177 [2023-02-14 13:25:53,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:53,538 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:53,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:25:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-14 13:25:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-14 13:25:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 141 states have (on average 1.6595744680851063) internal successors, (234), 176 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2023-02-14 13:25:53,542 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 14 [2023-02-14 13:25:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:53,543 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2023-02-14 13:25:53,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2023-02-14 13:25:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 13:25:53,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:53,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:53,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 13:25:53,544 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:53,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1556334460, now seen corresponding path program 1 times [2023-02-14 13:25:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:53,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690129578] [2023-02-14 13:25:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690129578] [2023-02-14 13:25:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690129578] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:53,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:53,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:25:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856862466] [2023-02-14 13:25:53,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:53,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:25:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:53,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:25:53,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:53,584 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:53,600 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2023-02-14 13:25:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:25:53,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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 16 [2023-02-14 13:25:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:53,601 INFO L225 Difference]: With dead ends: 192 [2023-02-14 13:25:53,602 INFO L226 Difference]: Without dead ends: 192 [2023-02-14 13:25:53,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:53,602 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:53,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 216 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:25:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-14 13:25:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2023-02-14 13:25:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 143 states have (on average 1.6293706293706294) internal successors, (233), 178 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2023-02-14 13:25:53,607 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 16 [2023-02-14 13:25:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:53,607 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2023-02-14 13:25:53,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2023-02-14 13:25:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 13:25:53,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:53,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:53,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 13:25:53,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2023-02-14 13:25:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:53,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098541363] [2023-02-14 13:25:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098541363] [2023-02-14 13:25:53,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098541363] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:53,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:53,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:25:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535534267] [2023-02-14 13:25:53,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:53,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:25:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:25:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:25:53,838 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:54,063 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2023-02-14 13:25:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:25:54,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 16 [2023-02-14 13:25:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:54,065 INFO L225 Difference]: With dead ends: 274 [2023-02-14 13:25:54,065 INFO L226 Difference]: Without dead ends: 274 [2023-02-14 13:25:54,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:25:54,068 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 125 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:54,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 413 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:25:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-14 13:25:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 193. [2023-02-14 13:25:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 157 states have (on average 1.605095541401274) internal successors, (252), 192 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2023-02-14 13:25:54,074 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 16 [2023-02-14 13:25:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:54,075 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2023-02-14 13:25:54,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2023-02-14 13:25:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 13:25:54,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:54,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:54,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 13:25:54,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -508929720, now seen corresponding path program 1 times [2023-02-14 13:25:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:54,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090702629] [2023-02-14 13:25:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:54,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090702629] [2023-02-14 13:25:54,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090702629] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:54,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:54,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:25:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163379701] [2023-02-14 13:25:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:54,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:25:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:25:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:25:54,265 INFO L87 Difference]: Start difference. First operand 193 states and 252 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:54,478 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2023-02-14 13:25:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:25:54,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2023-02-14 13:25:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:54,479 INFO L225 Difference]: With dead ends: 273 [2023-02-14 13:25:54,480 INFO L226 Difference]: Without dead ends: 273 [2023-02-14 13:25:54,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-14 13:25:54,480 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 128 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:54,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 417 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:25:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-14 13:25:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 228. [2023-02-14 13:25:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.609375) internal successors, (309), 227 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 309 transitions. [2023-02-14 13:25:54,486 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 309 transitions. Word has length 17 [2023-02-14 13:25:54,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:54,487 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 309 transitions. [2023-02-14 13:25:54,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 309 transitions. [2023-02-14 13:25:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 13:25:54,488 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:54,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:54,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 13:25:54,488 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1001745105, now seen corresponding path program 1 times [2023-02-14 13:25:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:54,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128708389] [2023-02-14 13:25:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:54,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128708389] [2023-02-14 13:25:54,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128708389] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:54,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:54,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:25:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260015382] [2023-02-14 13:25:54,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:54,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 13:25:54,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:54,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 13:25:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 13:25:54,557 INFO L87 Difference]: Start difference. First operand 228 states and 309 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:54,669 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2023-02-14 13:25:54,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 13:25:54,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-02-14 13:25:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:54,671 INFO L225 Difference]: With dead ends: 266 [2023-02-14 13:25:54,671 INFO L226 Difference]: Without dead ends: 266 [2023-02-14 13:25:54,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:25:54,673 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 230 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:54,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 190 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-14 13:25:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2023-02-14 13:25:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 228 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 310 transitions. [2023-02-14 13:25:54,679 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 310 transitions. Word has length 17 [2023-02-14 13:25:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:54,679 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 310 transitions. [2023-02-14 13:25:54,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 310 transitions. [2023-02-14 13:25:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 13:25:54,681 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:54,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:54,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 13:25:54,682 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:54,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2023-02-14 13:25:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:54,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318838119] [2023-02-14 13:25:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318838119] [2023-02-14 13:25:54,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318838119] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:54,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:54,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:25:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008982191] [2023-02-14 13:25:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:54,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:25:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:25:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:25:54,812 INFO L87 Difference]: Start difference. First operand 229 states and 310 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:54,932 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2023-02-14 13:25:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:25:54,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-14 13:25:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:54,935 INFO L225 Difference]: With dead ends: 228 [2023-02-14 13:25:54,935 INFO L226 Difference]: Without dead ends: 228 [2023-02-14 13:25:54,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:25:54,935 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:54,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 287 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-14 13:25:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2023-02-14 13:25:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.5958549222797926) internal successors, (308), 227 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2023-02-14 13:25:54,941 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 18 [2023-02-14 13:25:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:54,942 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2023-02-14 13:25:54,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2023-02-14 13:25:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 13:25:54,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:54,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:54,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 13:25:54,944 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2023-02-14 13:25:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:54,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222501493] [2023-02-14 13:25:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:55,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222501493] [2023-02-14 13:25:55,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222501493] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:55,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:55,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:25:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765029848] [2023-02-14 13:25:55,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:55,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:25:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:25:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:25:55,091 INFO L87 Difference]: Start difference. First operand 228 states and 308 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:55,212 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2023-02-14 13:25:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:25:55,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-02-14 13:25:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:55,213 INFO L225 Difference]: With dead ends: 227 [2023-02-14 13:25:55,213 INFO L226 Difference]: Without dead ends: 227 [2023-02-14 13:25:55,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:25:55,214 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:55,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 264 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-14 13:25:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-02-14 13:25:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 193 states have (on average 1.5854922279792747) internal successors, (306), 226 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2023-02-14 13:25:55,218 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 18 [2023-02-14 13:25:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:55,218 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2023-02-14 13:25:55,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2023-02-14 13:25:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 13:25:55,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:55,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:55,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 13:25:55,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash 624480237, now seen corresponding path program 1 times [2023-02-14 13:25:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:55,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226903924] [2023-02-14 13:25:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:55,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:55,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226903924] [2023-02-14 13:25:55,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226903924] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:55,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:55,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:25:55,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927551729] [2023-02-14 13:25:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:55,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:25:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:55,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:25:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:25:55,319 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:55,463 INFO L93 Difference]: Finished difference Result 243 states and 325 transitions. [2023-02-14 13:25:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:25:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2023-02-14 13:25:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:55,465 INFO L225 Difference]: With dead ends: 243 [2023-02-14 13:25:55,465 INFO L226 Difference]: Without dead ends: 243 [2023-02-14 13:25:55,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:25:55,466 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:55,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 301 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-14 13:25:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2023-02-14 13:25:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 200 states have (on average 1.575) internal successors, (315), 233 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2023-02-14 13:25:55,471 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 19 [2023-02-14 13:25:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:55,471 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2023-02-14 13:25:55,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2023-02-14 13:25:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 13:25:55,472 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:55,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:55,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 13:25:55,473 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash 624664935, now seen corresponding path program 1 times [2023-02-14 13:25:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:55,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604123875] [2023-02-14 13:25:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:55,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604123875] [2023-02-14 13:25:55,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604123875] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:55,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:55,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:25:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266791618] [2023-02-14 13:25:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:55,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:25:55,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:55,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:25:55,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:25:55,612 INFO L87 Difference]: Start difference. First operand 234 states and 315 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:55,782 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2023-02-14 13:25:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 13:25:55,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2023-02-14 13:25:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:55,783 INFO L225 Difference]: With dead ends: 236 [2023-02-14 13:25:55,783 INFO L226 Difference]: Without dead ends: 236 [2023-02-14 13:25:55,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:25:55,784 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:55,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 415 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-14 13:25:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2023-02-14 13:25:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 172 states have (on average 1.5406976744186047) internal successors, (265), 205 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 265 transitions. [2023-02-14 13:25:55,788 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 265 transitions. Word has length 19 [2023-02-14 13:25:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:55,789 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 265 transitions. [2023-02-14 13:25:55,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 265 transitions. [2023-02-14 13:25:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-14 13:25:55,789 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:55,789 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:55,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 13:25:55,789 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1555885541, now seen corresponding path program 1 times [2023-02-14 13:25:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:55,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218778565] [2023-02-14 13:25:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:55,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:55,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218778565] [2023-02-14 13:25:55,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218778565] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:55,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:55,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 13:25:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335918088] [2023-02-14 13:25:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:55,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 13:25:55,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:55,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 13:25:55,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:55,821 INFO L87 Difference]: Start difference. First operand 206 states and 265 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:55,829 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2023-02-14 13:25:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 13:25:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2023-02-14 13:25:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:55,830 INFO L225 Difference]: With dead ends: 181 [2023-02-14 13:25:55,830 INFO L226 Difference]: Without dead ends: 181 [2023-02-14 13:25:55,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 13:25:55,831 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:55,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 13:25:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-14 13:25:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2023-02-14 13:25:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 214 transitions. [2023-02-14 13:25:55,835 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 214 transitions. Word has length 20 [2023-02-14 13:25:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:55,836 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 214 transitions. [2023-02-14 13:25:55,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 214 transitions. [2023-02-14 13:25:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 13:25:55,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:55,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:55,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 13:25:55,837 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:55,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash 987811916, now seen corresponding path program 1 times [2023-02-14 13:25:55,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:55,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776680823] [2023-02-14 13:25:55,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:55,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:55,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776680823] [2023-02-14 13:25:55,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776680823] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:25:55,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872932565] [2023-02-14 13:25:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:55,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:25:55,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:25:55,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:25:55,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 13:25:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:55,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 13:25:55,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:25:56,102 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 13 treesize of output 9 [2023-02-14 13:25:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:56,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:25:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:56,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872932565] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:25:56,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:25:56,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-14 13:25:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037649515] [2023-02-14 13:25:56,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:25:56,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:25:56,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:56,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:25:56,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:25:56,172 INFO L87 Difference]: Start difference. First operand 179 states and 214 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:56,374 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2023-02-14 13:25:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 13:25:56,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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 21 [2023-02-14 13:25:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:56,375 INFO L225 Difference]: With dead ends: 189 [2023-02-14 13:25:56,375 INFO L226 Difference]: Without dead ends: 173 [2023-02-14 13:25:56,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:25:56,376 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:56,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 356 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:25:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-14 13:25:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2023-02-14 13:25:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.4963503649635037) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2023-02-14 13:25:56,379 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 21 [2023-02-14 13:25:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:56,379 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2023-02-14 13:25:56,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2023-02-14 13:25:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 13:25:56,380 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:56,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:56,390 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-14 13:25:56,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-14 13:25:56,586 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2023-02-14 13:25:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:56,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435894557] [2023-02-14 13:25:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435894557] [2023-02-14 13:25:56,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435894557] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:56,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:56,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:25:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071988030] [2023-02-14 13:25:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:56,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:25:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:56,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:25:56,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:25:56,760 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:56,970 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2023-02-14 13:25:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:25:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 13:25:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:56,971 INFO L225 Difference]: With dead ends: 172 [2023-02-14 13:25:56,971 INFO L226 Difference]: Without dead ends: 172 [2023-02-14 13:25:56,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-14 13:25:56,972 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:56,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 199 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-14 13:25:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2023-02-14 13:25:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.4817518248175183) internal successors, (203), 169 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2023-02-14 13:25:56,975 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 21 [2023-02-14 13:25:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:56,975 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2023-02-14 13:25:56,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2023-02-14 13:25:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 13:25:56,976 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:56,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:56,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-14 13:25:56,976 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2023-02-14 13:25:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552159680] [2023-02-14 13:25:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:57,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:57,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552159680] [2023-02-14 13:25:57,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552159680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:57,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:57,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:25:57,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970584741] [2023-02-14 13:25:57,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:57,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:25:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:57,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:25:57,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:25:57,215 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:57,519 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2023-02-14 13:25:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:25:57,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 13:25:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:57,520 INFO L225 Difference]: With dead ends: 171 [2023-02-14 13:25:57,520 INFO L226 Difference]: Without dead ends: 171 [2023-02-14 13:25:57,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-14 13:25:57,521 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 89 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:57,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 257 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:25:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-14 13:25:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2023-02-14 13:25:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.467153284671533) internal successors, (201), 168 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2023-02-14 13:25:57,524 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 21 [2023-02-14 13:25:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:57,525 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2023-02-14 13:25:57,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2023-02-14 13:25:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:25:57,525 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:57,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:57,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-14 13:25:57,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2023-02-14 13:25:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515209532] [2023-02-14 13:25:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:57,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:57,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515209532] [2023-02-14 13:25:57,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515209532] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:57,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:57,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:25:57,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168766241] [2023-02-14 13:25:57,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:57,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:25:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:25:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:25:57,604 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:57,718 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2023-02-14 13:25:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:25:57,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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 22 [2023-02-14 13:25:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:57,720 INFO L225 Difference]: With dead ends: 168 [2023-02-14 13:25:57,720 INFO L226 Difference]: Without dead ends: 168 [2023-02-14 13:25:57,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:25:57,721 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:57,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 277 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-14 13:25:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-02-14 13:25:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 167 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2023-02-14 13:25:57,728 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 22 [2023-02-14 13:25:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:57,728 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2023-02-14 13:25:57,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2023-02-14 13:25:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 13:25:57,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:57,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:57,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-14 13:25:57,729 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:57,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2023-02-14 13:25:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:57,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072227782] [2023-02-14 13:25:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:57,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:57,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:57,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072227782] [2023-02-14 13:25:57,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072227782] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:57,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:57,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 13:25:57,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790074656] [2023-02-14 13:25:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:57,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 13:25:57,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:57,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 13:25:57,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 13:25:57,897 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:58,035 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2023-02-14 13:25:58,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:25:58,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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 22 [2023-02-14 13:25:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:58,036 INFO L225 Difference]: With dead ends: 167 [2023-02-14 13:25:58,036 INFO L226 Difference]: Without dead ends: 167 [2023-02-14 13:25:58,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 13:25:58,037 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:58,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 254 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-14 13:25:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2023-02-14 13:25:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 137 states have (on average 1.437956204379562) internal successors, (197), 166 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2023-02-14 13:25:58,040 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 22 [2023-02-14 13:25:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:58,041 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2023-02-14 13:25:58,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2023-02-14 13:25:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 13:25:58,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:58,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:58,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-14 13:25:58,041 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2023-02-14 13:25:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:58,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789180322] [2023-02-14 13:25:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:58,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:58,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789180322] [2023-02-14 13:25:58,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789180322] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:58,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:58,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:25:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839278583] [2023-02-14 13:25:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:58,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:25:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:25:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:25:58,206 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:58,455 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2023-02-14 13:25:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:25:58,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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 25 [2023-02-14 13:25:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:58,457 INFO L225 Difference]: With dead ends: 168 [2023-02-14 13:25:58,457 INFO L226 Difference]: Without dead ends: 168 [2023-02-14 13:25:58,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-14 13:25:58,458 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:58,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 265 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 13:25:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-14 13:25:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2023-02-14 13:25:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 165 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2023-02-14 13:25:58,461 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 25 [2023-02-14 13:25:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:58,461 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2023-02-14 13:25:58,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2023-02-14 13:25:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 13:25:58,462 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:58,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:58,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-14 13:25:58,463 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2023-02-14 13:25:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:58,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603322794] [2023-02-14 13:25:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:58,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:58,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603322794] [2023-02-14 13:25:58,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603322794] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:25:58,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:25:58,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 13:25:58,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300003829] [2023-02-14 13:25:58,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:25:58,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 13:25:58,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:25:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 13:25:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 13:25:58,702 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:25:58,921 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2023-02-14 13:25:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 13:25:58,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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 25 [2023-02-14 13:25:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:25:58,923 INFO L225 Difference]: With dead ends: 167 [2023-02-14 13:25:58,923 INFO L226 Difference]: Without dead ends: 167 [2023-02-14 13:25:58,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-14 13:25:58,923 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 84 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 13:25:58,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 185 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 13:25:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-14 13:25:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2023-02-14 13:25:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 137 states have (on average 1.4233576642335766) internal successors, (195), 164 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 195 transitions. [2023-02-14 13:25:58,927 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 195 transitions. Word has length 25 [2023-02-14 13:25:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:25:58,927 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 195 transitions. [2023-02-14 13:25:58,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:25:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 195 transitions. [2023-02-14 13:25:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 13:25:58,927 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:25:58,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:25:58,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-14 13:25:58,928 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:25:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:25:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2023-02-14 13:25:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:25:58,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456061528] [2023-02-14 13:25:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:58,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:25:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:25:59,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:25:59,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456061528] [2023-02-14 13:25:59,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456061528] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:25:59,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652649220] [2023-02-14 13:25:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:25:59,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:25:59,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:25:59,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:25:59,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 13:25:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:25:59,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 13:25:59,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:26:00,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:26:00,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:26:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:00,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:26:00,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:00,595 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 48 treesize of output 47 [2023-02-14 13:26:00,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:00,607 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 42 treesize of output 41 [2023-02-14 13:26:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652649220] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:26:00,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:26:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 33 [2023-02-14 13:26:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667839990] [2023-02-14 13:26:00,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:26:00,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 13:26:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:26:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 13:26:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2023-02-14 13:26:00,925 INFO L87 Difference]: Start difference. First operand 165 states and 195 transitions. Second operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:26:03,224 INFO L93 Difference]: Finished difference Result 319 states and 372 transitions. [2023-02-14 13:26:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-14 13:26:03,225 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-14 13:26:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:26:03,226 INFO L225 Difference]: With dead ends: 319 [2023-02-14 13:26:03,226 INFO L226 Difference]: Without dead ends: 319 [2023-02-14 13:26:03,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=973, Invalid=3059, Unknown=0, NotChecked=0, Total=4032 [2023-02-14 13:26:03,228 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1044 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 13:26:03,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1024 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-14 13:26:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-02-14 13:26:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 189. [2023-02-14 13:26:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 188 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2023-02-14 13:26:03,233 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 38 [2023-02-14 13:26:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:26:03,233 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2023-02-14 13:26:03,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2023-02-14 13:26:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 13:26:03,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:26:03,234 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:26:03,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 13:26:03,434 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,SelfDestructingSolverStorable23 [2023-02-14 13:26:03,435 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:26:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:26:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2023-02-14 13:26:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:26:03,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013944765] [2023-02-14 13:26:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:03,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:26:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:26:03,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013944765] [2023-02-14 13:26:03,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013944765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:26:03,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144007504] [2023-02-14 13:26:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:03,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:26:03,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:26:03,892 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:26:03,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 13:26:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:04,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 13:26:04,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:26:04,283 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:26:04,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:26:04,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:26:04,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:26:04,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:26:04,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 13:26:04,424 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:26:04,424 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 42 treesize of output 41 [2023-02-14 13:26:04,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 13:26:04,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:26:04,496 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 42 treesize of output 41 [2023-02-14 13:26:04,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 13:26:04,576 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-14 13:26:04,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:26:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:04,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:26:04,653 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)))) (and (forall ((v_ArrVal_549 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_549) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-14 13:26:04,675 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-14 13:26:04,686 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_547))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-14 13:26:04,709 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_549 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_547))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_549)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_545 Int)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 v_ArrVal_545)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_546) (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_548) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-14 13:26:05,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:05,173 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 112 [2023-02-14 13:26:05,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:05,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 109 [2023-02-14 13:26:05,225 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-02-14 13:26:05,226 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 289 treesize of output 211 [2023-02-14 13:26:05,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 171 [2023-02-14 13:26:05,252 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-02-14 13:26:05,252 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 308 treesize of output 292 [2023-02-14 13:26:05,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 287 treesize of output 277 [2023-02-14 13:26:05,271 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 277 treesize of output 273 [2023-02-14 13:26:05,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:05,288 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 273 treesize of output 266 [2023-02-14 13:26:05,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 251 [2023-02-14 13:26:05,306 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 251 treesize of output 227 [2023-02-14 13:26:05,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:05,327 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 234 treesize of output 252 [2023-02-14 13:26:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:05,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144007504] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:26:05,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:26:05,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2023-02-14 13:26:05,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788080011] [2023-02-14 13:26:05,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:26:05,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 13:26:05,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:26:05,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 13:26:05,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=721, Unknown=11, NotChecked=236, Total=1122 [2023-02-14 13:26:05,471 INFO L87 Difference]: Start difference. First operand 189 states and 223 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:26:07,277 INFO L93 Difference]: Finished difference Result 392 states and 460 transitions. [2023-02-14 13:26:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 13:26:07,277 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 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) Word has length 38 [2023-02-14 13:26:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:26:07,278 INFO L225 Difference]: With dead ends: 392 [2023-02-14 13:26:07,279 INFO L226 Difference]: Without dead ends: 392 [2023-02-14 13:26:07,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=479, Invalid=1688, Unknown=11, NotChecked=372, Total=2550 [2023-02-14 13:26:07,280 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 695 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 853 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:26:07,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1213 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1207 Invalid, 0 Unknown, 853 Unchecked, 1.0s Time] [2023-02-14 13:26:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-02-14 13:26:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 224. [2023-02-14 13:26:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 223 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 267 transitions. [2023-02-14 13:26:07,286 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 267 transitions. Word has length 38 [2023-02-14 13:26:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:26:07,286 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 267 transitions. [2023-02-14 13:26:07,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2023-02-14 13:26:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 13:26:07,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:26:07,287 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:26:07,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 13:26:07,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:26:07,493 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:26:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:26:07,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589588, now seen corresponding path program 1 times [2023-02-14 13:26:07,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:26:07,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122627025] [2023-02-14 13:26:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:07,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:26:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:07,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:26:07,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122627025] [2023-02-14 13:26:07,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122627025] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:26:07,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313481067] [2023-02-14 13:26:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:26:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:26:07,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:26:07,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 13:26:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:07,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 13:26:07,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:26:08,038 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:26:08,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:26:08,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:26:08,144 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:26:08,145 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 19 treesize of output 22 [2023-02-14 13:26:08,183 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:26:08,183 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 28 treesize of output 29 [2023-02-14 13:26:08,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 13:26:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:08,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:26:08,325 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-02-14 13:26:08,326 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 19 treesize of output 18 [2023-02-14 13:26:08,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) |c_ULTIMATE.start_main_#t~mem16#1.base|)) is different from false [2023-02-14 13:26:08,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_620))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) .cse1)))) is different from false [2023-02-14 13:26:08,362 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_620))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_621) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2023-02-14 13:26:08,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:08,369 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 1 case distinctions, treesize of input 51 treesize of output 36 [2023-02-14 13:26:08,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:08,379 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 330 treesize of output 265 [2023-02-14 13:26:08,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:08,394 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 222 [2023-02-14 13:26:08,399 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 214 treesize of output 198 [2023-02-14 13:26:08,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:08,879 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 28 treesize of output 46 [2023-02-14 13:26:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313481067] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:26:08,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:26:08,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-02-14 13:26:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263811798] [2023-02-14 13:26:08,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:26:08,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-14 13:26:08,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:26:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-14 13:26:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=506, Unknown=4, NotChecked=144, Total=756 [2023-02-14 13:26:08,898 INFO L87 Difference]: Start difference. First operand 224 states and 267 transitions. Second operand has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:26:09,904 INFO L93 Difference]: Finished difference Result 407 states and 488 transitions. [2023-02-14 13:26:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 13:26:09,905 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 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) Word has length 39 [2023-02-14 13:26:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:26:09,906 INFO L225 Difference]: With dead ends: 407 [2023-02-14 13:26:09,906 INFO L226 Difference]: Without dead ends: 407 [2023-02-14 13:26:09,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=304, Invalid=1036, Unknown=4, NotChecked=216, Total=1560 [2023-02-14 13:26:09,907 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 569 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 684 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:26:09,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 885 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1246 Invalid, 0 Unknown, 684 Unchecked, 0.7s Time] [2023-02-14 13:26:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-02-14 13:26:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 318. [2023-02-14 13:26:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 290 states have (on average 1.3793103448275863) internal successors, (400), 317 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 400 transitions. [2023-02-14 13:26:09,920 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 400 transitions. Word has length 39 [2023-02-14 13:26:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:26:09,920 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 400 transitions. [2023-02-14 13:26:09,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 28 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 400 transitions. [2023-02-14 13:26:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 13:26:09,921 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:26:09,921 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:26:09,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-14 13:26:10,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-14 13:26:10,126 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:26:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:26:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589587, now seen corresponding path program 1 times [2023-02-14 13:26:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:26:10,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976477186] [2023-02-14 13:26:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:10,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:26:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:10,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:26:10,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976477186] [2023-02-14 13:26:10,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976477186] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:26:10,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079636830] [2023-02-14 13:26:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:26:10,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:26:10,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:26:10,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 13:26:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:10,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-14 13:26:10,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:26:10,782 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:26:10,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:26:10,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:26:10,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:26:10,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 13:26:10,914 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:26:10,914 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 38 treesize of output 37 [2023-02-14 13:26:10,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:26:10,980 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:26:10,980 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 38 treesize of output 37 [2023-02-14 13:26:10,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 13:26:11,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 13:26:11,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 13:26:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:11,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:26:11,382 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (forall ((v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2023-02-14 13:26:11,398 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_696) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_695) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_695))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_696) .cse0 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) is different from false [2023-02-14 13:26:11,411 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_696) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_695) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_695))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_696) .cse1 v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_698) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))))) is different from false [2023-02-14 13:26:11,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:11,428 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 1 case distinctions, treesize of input 73 treesize of output 74 [2023-02-14 13:26:11,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:11,437 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 1 case distinctions, treesize of input 65 treesize of output 50 [2023-02-14 13:26:11,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:11,447 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 334 treesize of output 301 [2023-02-14 13:26:11,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:11,464 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 598 treesize of output 573 [2023-02-14 13:26:11,475 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 558 treesize of output 534 [2023-02-14 13:26:11,483 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 534 treesize of output 510 [2023-02-14 13:26:11,508 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 510 treesize of output 502 [2023-02-14 13:26:11,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:11,523 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 502 treesize of output 458 [2023-02-14 13:26:13,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:13,692 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 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-14 13:26:13,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:13,698 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 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 13:26:13,701 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:26:13,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2023-02-14 13:26:13,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:26:13,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 13:26:13,864 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:26:13,865 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 28 treesize of output 46 [2023-02-14 13:26:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:13,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079636830] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:26:13,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:26:13,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-02-14 13:26:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050155540] [2023-02-14 13:26:13,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:26:13,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 13:26:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:26:13,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 13:26:13,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=795, Unknown=11, NotChecked=180, Total=1122 [2023-02-14 13:26:13,879 INFO L87 Difference]: Start difference. First operand 318 states and 400 transitions. Second operand has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:26:45,601 INFO L93 Difference]: Finished difference Result 488 states and 580 transitions. [2023-02-14 13:26:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 13:26:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 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 39 [2023-02-14 13:26:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:26:45,603 INFO L225 Difference]: With dead ends: 488 [2023-02-14 13:26:45,603 INFO L226 Difference]: Without dead ends: 488 [2023-02-14 13:26:45,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=650, Invalid=2418, Unknown=24, NotChecked=330, Total=3422 [2023-02-14 13:26:45,604 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 909 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 703 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:26:45,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1048 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1296 Invalid, 0 Unknown, 703 Unchecked, 4.2s Time] [2023-02-14 13:26:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-02-14 13:26:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 321. [2023-02-14 13:26:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 299 states have (on average 1.3678929765886287) internal successors, (409), 320 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 409 transitions. [2023-02-14 13:26:45,611 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 409 transitions. Word has length 39 [2023-02-14 13:26:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:26:45,611 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 409 transitions. [2023-02-14 13:26:45,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.3333333333333335) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2023-02-14 13:26:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 13:26:45,612 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:26:45,612 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:26:45,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-14 13:26:45,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-14 13:26:45,824 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:26:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:26:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1594404890, now seen corresponding path program 1 times [2023-02-14 13:26:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:26:45,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361097998] [2023-02-14 13:26:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:45,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:26:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 13:26:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:26:46,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361097998] [2023-02-14 13:26:46,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361097998] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:26:46,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:26:46,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 13:26:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195603352] [2023-02-14 13:26:46,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:26:46,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 13:26:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:26:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 13:26:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 13:26:46,126 INFO L87 Difference]: Start difference. First operand 321 states and 409 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:26:46,955 INFO L93 Difference]: Finished difference Result 321 states and 406 transitions. [2023-02-14 13:26:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 13:26:46,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 39 [2023-02-14 13:26:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:26:46,957 INFO L225 Difference]: With dead ends: 321 [2023-02-14 13:26:46,957 INFO L226 Difference]: Without dead ends: 321 [2023-02-14 13:26:46,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-14 13:26:46,958 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 13:26:46,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 299 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-14 13:26:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-02-14 13:26:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2023-02-14 13:26:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 296 states have (on average 1.3614864864864864) internal successors, (403), 317 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 403 transitions. [2023-02-14 13:26:46,963 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 403 transitions. Word has length 39 [2023-02-14 13:26:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:26:46,963 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 403 transitions. [2023-02-14 13:26:46,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 403 transitions. [2023-02-14 13:26:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 13:26:46,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:26:46,964 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:26:46,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-14 13:26:46,965 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:26:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:26:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1677406060, now seen corresponding path program 1 times [2023-02-14 13:26:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:26:46,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97490551] [2023-02-14 13:26:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:26:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:26:48,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97490551] [2023-02-14 13:26:48,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97490551] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:26:48,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:26:48,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-14 13:26:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839705128] [2023-02-14 13:26:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:26:48,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 13:26:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:26:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 13:26:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-14 13:26:48,321 INFO L87 Difference]: Start difference. First operand 318 states and 403 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:26:51,670 INFO L93 Difference]: Finished difference Result 442 states and 541 transitions. [2023-02-14 13:26:51,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 13:26:51,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 39 [2023-02-14 13:26:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:26:51,675 INFO L225 Difference]: With dead ends: 442 [2023-02-14 13:26:51,675 INFO L226 Difference]: Without dead ends: 442 [2023-02-14 13:26:51,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2023-02-14 13:26:51,676 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 187 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:26:51,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 738 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-14 13:26:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-02-14 13:26:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 326. [2023-02-14 13:26:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 304 states have (on average 1.381578947368421) internal successors, (420), 325 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 420 transitions. [2023-02-14 13:26:51,682 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 420 transitions. Word has length 39 [2023-02-14 13:26:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:26:51,682 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 420 transitions. [2023-02-14 13:26:51,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 420 transitions. [2023-02-14 13:26:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:26:51,683 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:26:51,683 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:26:51,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-14 13:26:51,683 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:26:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:26:51,684 INFO L85 PathProgramCache]: Analyzing trace with hash 982584715, now seen corresponding path program 1 times [2023-02-14 13:26:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:26:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154448117] [2023-02-14 13:26:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:26:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:52,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:26:52,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154448117] [2023-02-14 13:26:52,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154448117] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:26:52,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:26:52,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 13:26:52,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044852626] [2023-02-14 13:26:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:26:52,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 13:26:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:26:52,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 13:26:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-14 13:26:52,666 INFO L87 Difference]: Start difference. First operand 326 states and 420 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:26:54,781 INFO L93 Difference]: Finished difference Result 533 states and 657 transitions. [2023-02-14 13:26:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 13:26:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 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 41 [2023-02-14 13:26:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:26:54,787 INFO L225 Difference]: With dead ends: 533 [2023-02-14 13:26:54,787 INFO L226 Difference]: Without dead ends: 529 [2023-02-14 13:26:54,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2023-02-14 13:26:54,788 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 266 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-14 13:26:54,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 585 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-14 13:26:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-02-14 13:26:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 362. [2023-02-14 13:26:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 340 states have (on average 1.3676470588235294) internal successors, (465), 361 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 465 transitions. [2023-02-14 13:26:54,796 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 465 transitions. Word has length 41 [2023-02-14 13:26:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:26:54,796 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 465 transitions. [2023-02-14 13:26:54,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:26:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 465 transitions. [2023-02-14 13:26:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:26:54,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:26:54,797 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:26:54,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-14 13:26:54,798 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:26:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:26:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341771, now seen corresponding path program 1 times [2023-02-14 13:26:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:26:54,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182063395] [2023-02-14 13:26:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:26:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:26:55,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182063395] [2023-02-14 13:26:55,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182063395] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:26:55,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741119274] [2023-02-14 13:26:55,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:26:55,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:26:55,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:26:55,901 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:26:55,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 13:26:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:26:56,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 13:26:56,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:26:56,646 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:26:56,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 13:26:56,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:26:57,171 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:26:57,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-14 13:26:57,423 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:26:57,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-14 13:26:58,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:26:58,214 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-14 13:26:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:26:58,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:27:03,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:03,897 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 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-14 13:27:03,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:03,936 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 170 treesize of output 145 [2023-02-14 13:27:03,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:03,975 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 130 treesize of output 118 [2023-02-14 13:27:03,985 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 110 treesize of output 102 [2023-02-14 13:27:12,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:12,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 248 [2023-02-14 13:27:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:27:17,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741119274] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:27:17,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:27:17,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2023-02-14 13:27:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573317264] [2023-02-14 13:27:17,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:27:17,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 13:27:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:27:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 13:27:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=979, Unknown=25, NotChecked=0, Total=1190 [2023-02-14 13:27:17,493 INFO L87 Difference]: Start difference. First operand 362 states and 465 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:27:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:27:25,321 INFO L93 Difference]: Finished difference Result 675 states and 859 transitions. [2023-02-14 13:27:25,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 13:27:25,321 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 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) Word has length 41 [2023-02-14 13:27:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:27:25,323 INFO L225 Difference]: With dead ends: 675 [2023-02-14 13:27:25,324 INFO L226 Difference]: Without dead ends: 675 [2023-02-14 13:27:25,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=444, Invalid=1787, Unknown=25, NotChecked=0, Total=2256 [2023-02-14 13:27:25,325 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1134 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-02-14 13:27:25,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1298 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-02-14 13:27:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2023-02-14 13:27:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 472. [2023-02-14 13:27:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 450 states have (on average 1.3644444444444443) internal successors, (614), 471 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:27:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 614 transitions. [2023-02-14 13:27:25,333 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 614 transitions. Word has length 41 [2023-02-14 13:27:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:27:25,333 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 614 transitions. [2023-02-14 13:27:25,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:27:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 614 transitions. [2023-02-14 13:27:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 13:27:25,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:27:25,334 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:27:25,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 13:27:25,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:27:25,540 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:27:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:27:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341772, now seen corresponding path program 1 times [2023-02-14 13:27:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:27:25,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457261866] [2023-02-14 13:27:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:27:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:27:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:27:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:27:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:27:28,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457261866] [2023-02-14 13:27:28,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457261866] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:27:28,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615674800] [2023-02-14 13:27:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:27:28,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:27:28,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:27:28,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:27:28,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 13:27:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:27:28,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-14 13:27:28,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:27:29,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:27:29,303 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:27:29,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:27:29,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:27:29,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:27:30,094 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:27:30,094 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 46 treesize of output 45 [2023-02-14 13:27:30,121 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 22 treesize of output 24 [2023-02-14 13:27:30,465 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:27:30,466 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 46 treesize of output 45 [2023-02-14 13:27:30,476 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 22 treesize of output 24 [2023-02-14 13:27:31,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:27:31,733 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-14 13:27:31,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:27:31,744 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-14 13:27:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:27:32,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:27:34,081 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_75| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_75|)) (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_75| |c_ULTIMATE.start_main_~root~0#1.offset|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_948) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_950) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |v_ULTIMATE.start_main_~n~0#1.offset_75| 4))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.offset_75| Int) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_75|)) (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_75| |c_ULTIMATE.start_main_~root~0#1.offset|)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_947))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0)) (.cse2 (+ |v_ULTIMATE.start_main_~n~0#1.offset_75| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_948) .cse1 v_ArrVal_950) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_949) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))))))) is different from false [2023-02-14 13:27:34,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:34,729 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 1 case distinctions, treesize of input 44 treesize of output 45 [2023-02-14 13:27:34,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:34,750 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 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-14 13:27:34,761 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 60 treesize of output 48 [2023-02-14 13:27:34,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:34,802 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 122 treesize of output 115 [2023-02-14 13:27:34,812 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 74 treesize of output 58 [2023-02-14 13:27:34,824 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 84 treesize of output 72 [2023-02-14 13:27:34,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-02-14 13:27:35,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:35,092 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 1 case distinctions, treesize of input 89 treesize of output 90 [2023-02-14 13:27:35,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:35,111 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 1 case distinctions, treesize of input 79 treesize of output 60 [2023-02-14 13:27:35,117 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:27:35,118 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:27:35,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:27:35,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:27:35,134 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2023-02-14 13:27:35,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:27:35,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:27:35,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:27:35,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2023-02-14 13:27:35,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 15 treesize of output 11 [2023-02-14 13:27:37,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:27:37,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2023-02-14 13:27:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:27:37,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615674800] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:27:37,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:27:37,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 14] total 43 [2023-02-14 13:27:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937346282] [2023-02-14 13:27:37,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:27:37,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-14 13:27:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:27:37,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-14 13:27:37,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1605, Unknown=19, NotChecked=82, Total=1892 [2023-02-14 13:27:37,676 INFO L87 Difference]: Start difference. First operand 472 states and 614 transitions. Second operand has 44 states, 43 states have (on average 2.7209302325581395) internal successors, (117), 44 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:13,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-14 13:28:15,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-14 13:28:19,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-14 13:28:21,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-14 13:28:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:28:31,017 INFO L93 Difference]: Finished difference Result 1798 states and 2221 transitions. [2023-02-14 13:28:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-02-14 13:28:31,017 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.7209302325581395) internal successors, (117), 44 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) Word has length 41 [2023-02-14 13:28:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:28:31,022 INFO L225 Difference]: With dead ends: 1798 [2023-02-14 13:28:31,022 INFO L226 Difference]: Without dead ends: 1798 [2023-02-14 13:28:31,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4918 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=2934, Invalid=13562, Unknown=20, NotChecked=254, Total=16770 [2023-02-14 13:28:31,026 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 3302 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 5270 mSolverCounterSat, 408 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3302 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 6038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 5270 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:28:31,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3302 Valid, 3014 Invalid, 6038 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [408 Valid, 5270 Invalid, 4 Unknown, 356 Unchecked, 28.2s Time] [2023-02-14 13:28:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2023-02-14 13:28:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 888. [2023-02-14 13:28:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 866 states have (on average 1.374133949191686) internal successors, (1190), 887 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1190 transitions. [2023-02-14 13:28:31,045 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1190 transitions. Word has length 41 [2023-02-14 13:28:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:28:31,046 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1190 transitions. [2023-02-14 13:28:31,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.7209302325581395) internal successors, (117), 44 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1190 transitions. [2023-02-14 13:28:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 13:28:31,047 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:28:31,047 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:28:31,053 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-14 13:28:31,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:28:31,254 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:28:31,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:28:31,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1351336816, now seen corresponding path program 1 times [2023-02-14 13:28:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:28:31,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187656330] [2023-02-14 13:28:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:28:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:28:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:28:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:28:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:28:32,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187656330] [2023-02-14 13:28:32,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187656330] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:28:32,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:28:32,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-14 13:28:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558072257] [2023-02-14 13:28:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:28:32,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 13:28:32,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:28:32,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 13:28:32,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-14 13:28:32,321 INFO L87 Difference]: Start difference. First operand 888 states and 1190 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:28:35,523 INFO L93 Difference]: Finished difference Result 1204 states and 1584 transitions. [2023-02-14 13:28:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 13:28:35,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 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 43 [2023-02-14 13:28:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:28:35,528 INFO L225 Difference]: With dead ends: 1204 [2023-02-14 13:28:35,528 INFO L226 Difference]: Without dead ends: 1198 [2023-02-14 13:28:35,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2023-02-14 13:28:35,529 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 227 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-14 13:28:35,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 755 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-14 13:28:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2023-02-14 13:28:35,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 866. [2023-02-14 13:28:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 844 states have (on average 1.3708530805687205) internal successors, (1157), 865 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1157 transitions. [2023-02-14 13:28:35,542 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1157 transitions. Word has length 43 [2023-02-14 13:28:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:28:35,543 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1157 transitions. [2023-02-14 13:28:35,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1157 transitions. [2023-02-14 13:28:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 13:28:35,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:28:35,544 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:28:35,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-14 13:28:35,544 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:28:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:28:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash -556665744, now seen corresponding path program 1 times [2023-02-14 13:28:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:28:35,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975313683] [2023-02-14 13:28:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:28:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:28:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:28:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:28:36,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:28:36,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975313683] [2023-02-14 13:28:36,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975313683] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 13:28:36,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 13:28:36,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-14 13:28:36,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081851161] [2023-02-14 13:28:36,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 13:28:36,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 13:28:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:28:36,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 13:28:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-14 13:28:36,423 INFO L87 Difference]: Start difference. First operand 866 states and 1157 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:39,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:28:39,869 INFO L93 Difference]: Finished difference Result 1243 states and 1649 transitions. [2023-02-14 13:28:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 13:28:39,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 43 [2023-02-14 13:28:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:28:39,873 INFO L225 Difference]: With dead ends: 1243 [2023-02-14 13:28:39,873 INFO L226 Difference]: Without dead ends: 1243 [2023-02-14 13:28:39,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2023-02-14 13:28:39,874 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 265 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-14 13:28:39,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 755 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-14 13:28:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-02-14 13:28:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 866. [2023-02-14 13:28:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 844 states have (on average 1.3661137440758293) internal successors, (1153), 865 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1153 transitions. [2023-02-14 13:28:39,888 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1153 transitions. Word has length 43 [2023-02-14 13:28:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:28:39,888 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1153 transitions. [2023-02-14 13:28:39,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:28:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1153 transitions. [2023-02-14 13:28:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:28:39,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:28:39,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:28:39,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-14 13:28:39,890 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:28:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:28:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash -659312340, now seen corresponding path program 1 times [2023-02-14 13:28:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:28:39,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100901936] [2023-02-14 13:28:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:28:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:28:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:28:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:28:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:28:41,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100901936] [2023-02-14 13:28:41,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100901936] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:28:41,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505261424] [2023-02-14 13:28:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:28:41,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:28:41,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:28:41,109 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:28:41,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 13:28:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:28:41,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 13:28:41,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:28:42,101 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 13:28:42,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 13:28:42,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:28:42,724 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:28:42,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-14 13:28:43,019 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:28:43,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-14 13:28:43,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:28:43,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2023-02-14 13:28:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:28:43,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:28:45,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:28:45,614 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 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-14 13:28:45,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:28:45,658 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 170 treesize of output 145 [2023-02-14 13:28:45,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:28:45,703 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 130 treesize of output 118 [2023-02-14 13:28:45,714 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 110 treesize of output 102 [2023-02-14 13:28:54,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:28:54,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 248 [2023-02-14 13:28:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:28:58,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505261424] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:28:58,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:28:58,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 34 [2023-02-14 13:28:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089859963] [2023-02-14 13:28:58,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:28:58,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 13:28:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:28:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 13:28:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=955, Unknown=25, NotChecked=0, Total=1190 [2023-02-14 13:28:58,138 INFO L87 Difference]: Start difference. First operand 866 states and 1153 transitions. Second operand has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:29:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 13:29:05,701 INFO L93 Difference]: Finished difference Result 1253 states and 1667 transitions. [2023-02-14 13:29:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 13:29:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 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) Word has length 46 [2023-02-14 13:29:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 13:29:05,705 INFO L225 Difference]: With dead ends: 1253 [2023-02-14 13:29:05,705 INFO L226 Difference]: Without dead ends: 1253 [2023-02-14 13:29:05,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=351, Invalid=1346, Unknown=25, NotChecked=0, Total=1722 [2023-02-14 13:29:05,706 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 823 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-02-14 13:29:05,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1269 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-02-14 13:29:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2023-02-14 13:29:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 870. [2023-02-14 13:29:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 848 states have (on average 1.366745283018868) internal successors, (1159), 869 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:29:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1159 transitions. [2023-02-14 13:29:05,719 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1159 transitions. Word has length 46 [2023-02-14 13:29:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 13:29:05,719 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1159 transitions. [2023-02-14 13:29:05,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.2941176470588234) internal successors, (112), 35 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 13:29:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1159 transitions. [2023-02-14 13:29:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 13:29:05,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 13:29:05,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 13:29:05,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 13:29:05,926 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,SelfDestructingSolverStorable34 [2023-02-14 13:29:05,927 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-02-14 13:29:05,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 13:29:05,927 INFO L85 PathProgramCache]: Analyzing trace with hash -659312339, now seen corresponding path program 1 times [2023-02-14 13:29:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 13:29:05,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894123932] [2023-02-14 13:29:05,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:29:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 13:29:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:29:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:29:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 13:29:10,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894123932] [2023-02-14 13:29:10,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894123932] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 13:29:10,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610776608] [2023-02-14 13:29:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 13:29:10,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 13:29:10,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 13:29:10,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 13:29:10,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 13:29:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 13:29:10,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-14 13:29:10,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 13:29:11,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 13:29:11,818 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 13:29:11,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 13:29:12,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:29:12,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 13:29:12,731 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:29:12,731 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 46 treesize of output 45 [2023-02-14 13:29:12,758 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 22 treesize of output 24 [2023-02-14 13:29:13,137 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 13:29:13,138 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 46 treesize of output 45 [2023-02-14 13:29:13,148 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 22 treesize of output 24 [2023-02-14 13:29:14,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:29:14,359 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-14 13:29:14,377 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:29:14,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:29:14,386 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 31 treesize of output 16 [2023-02-14 13:29:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:29:14,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 13:29:18,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:29:18,555 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 1 case distinctions, treesize of input 44 treesize of output 45 [2023-02-14 13:29:18,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:29:18,575 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 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-14 13:29:18,586 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 60 treesize of output 48 [2023-02-14 13:29:18,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:29:18,631 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 122 treesize of output 115 [2023-02-14 13:29:18,643 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 74 treesize of output 58 [2023-02-14 13:29:18,653 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 84 treesize of output 72 [2023-02-14 13:29:18,668 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 50 treesize of output 46 [2023-02-14 13:29:18,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:29:18,982 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 1 case distinctions, treesize of input 89 treesize of output 90 [2023-02-14 13:29:19,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:29:19,009 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 1 case distinctions, treesize of input 79 treesize of output 60 [2023-02-14 13:29:19,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:29:19,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:29:19,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:29:19,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:29:19,038 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2023-02-14 13:29:19,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 13:29:19,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:29:19,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 13:29:19,065 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2023-02-14 13:29:19,087 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 15 treesize of output 11 [2023-02-14 13:29:21,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 13:29:21,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2023-02-14 13:29:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 13:29:22,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610776608] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 13:29:22,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 13:29:22,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 15] total 51 [2023-02-14 13:29:22,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984710146] [2023-02-14 13:29:22,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 13:29:22,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 13:29:22,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 13:29:22,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 13:29:22,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2258, Unknown=48, NotChecked=0, Total=2652 [2023-02-14 13:29:22,978 INFO L87 Difference]: Start difference. First operand 870 states and 1159 transitions. Second operand has 52 states, 51 states have (on average 2.588235294117647) internal successors, (132), 52 states have internal predecessors, (132), 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)