./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 a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-a31fd05 [2023-02-15 12:58:43,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 12:58:43,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 12:58:43,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 12:58:43,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 12:58:43,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 12:58:43,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 12:58:43,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 12:58:43,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 12:58:43,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 12:58:43,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 12:58:43,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 12:58:43,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 12:58:43,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 12:58:43,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 12:58:43,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 12:58:43,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 12:58:43,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 12:58:43,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 12:58:43,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 12:58:43,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 12:58:43,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 12:58:43,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 12:58:43,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 12:58:43,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 12:58:43,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 12:58:43,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 12:58:43,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 12:58:43,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 12:58:43,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 12:58:43,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 12:58:43,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 12:58:43,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 12:58:43,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 12:58:43,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 12:58:43,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 12:58:43,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 12:58:43,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 12:58:43,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 12:58:43,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 12:58:43,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 12:58:43,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 12:58:43,349 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 12:58:43,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 12:58:43,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 12:58:43,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 12:58:43,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 12:58:43,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 12:58:43,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 12:58:43,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 12:58:43,352 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 12:58:43,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 12:58:43,353 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 12:58:43,353 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 12:58:43,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 12:58:43,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 12:58:43,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 12:58:43,353 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 12:58:43,353 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 12:58:43,354 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 12:58:43,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 12:58:43,354 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 12:58:43,354 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 12:58:43,354 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 12:58:43,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 12:58:43,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 12:58:43,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 12:58:43,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:58:43,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 12:58:43,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 12:58:43,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 12:58:43,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 12:58:43,355 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 12:58:43,356 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 12:58:43,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 12:58:43,356 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 12:58:43,356 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-15 12:58:43,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 12:58:43,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 12:58:43,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 12:58:43,548 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 12:58:43,549 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 12:58:43,549 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-15 12:58:44,596 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 12:58:44,745 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 12:58:44,746 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2023-02-15 12:58:44,757 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc8f24d9/8cbb51ebf3ac4c98b616dab265c7ceca/FLAG6ee23a0f8 [2023-02-15 12:58:44,766 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bc8f24d9/8cbb51ebf3ac4c98b616dab265c7ceca [2023-02-15 12:58:44,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 12:58:44,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 12:58:44,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 12:58:44,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 12:58:44,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 12:58:44,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:58:44" (1/1) ... [2023-02-15 12:58:44,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35afc32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:44, skipping insertion in model container [2023-02-15 12:58:44,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:58:44" (1/1) ... [2023-02-15 12:58:44,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 12:58:44,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 12:58:44,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:58:44,985 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 12:58:45,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 12:58:45,048 INFO L208 MainTranslator]: Completed translation [2023-02-15 12:58:45,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45 WrapperNode [2023-02-15 12:58:45,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 12:58:45,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 12:58:45,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 12:58:45,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 12:58:45,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,084 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2023-02-15 12:58:45,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 12:58:45,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 12:58:45,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 12:58:45,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 12:58:45,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,125 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 12:58:45,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 12:58:45,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 12:58:45,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 12:58:45,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (1/1) ... [2023-02-15 12:58:45,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 12:58:45,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:58:45,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 12:58:45,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 12:58:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 12:58:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 12:58:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 12:58:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 12:58:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 12:58:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 12:58:45,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 12:58:45,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 12:58:45,354 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 12:58:45,360 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 12:58:45,661 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 12:58:45,666 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 12:58:45,666 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 12:58:45,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:58:45 BoogieIcfgContainer [2023-02-15 12:58:45,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 12:58:45,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 12:58:45,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 12:58:45,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 12:58:45,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:58:44" (1/3) ... [2023-02-15 12:58:45,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578d78ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:58:45, skipping insertion in model container [2023-02-15 12:58:45,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:58:45" (2/3) ... [2023-02-15 12:58:45,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578d78ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:58:45, skipping insertion in model container [2023-02-15 12:58:45,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:58:45" (3/3) ... [2023-02-15 12:58:45,673 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_cnstr.i [2023-02-15 12:58:45,684 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 12:58:45,684 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2023-02-15 12:58:45,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 12:58:45,715 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;@3b3821fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 12:58:45,715 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-02-15 12:58:45,718 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-15 12:58:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 12:58:45,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:45,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 12:58:45,722 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-15 12:58:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 12:58:45,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:45,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167989871] [2023-02-15 12:58:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:45,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:45,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:45,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167989871] [2023-02-15 12:58:45,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167989871] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:45,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:45,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:58:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59166062] [2023-02-15 12:58:45,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:58:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:58:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:45,901 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-15 12:58:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:46,019 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2023-02-15 12:58:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:58:46,026 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-15 12:58:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:46,032 INFO L225 Difference]: With dead ends: 166 [2023-02-15 12:58:46,032 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 12:58:46,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,035 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-15 12:58:46,035 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-15 12:58:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 12:58:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 119. [2023-02-15 12:58:46,071 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-15 12:58:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-15 12:58:46,073 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 3 [2023-02-15 12:58:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:46,073 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-15 12:58:46,074 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-15 12:58:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-15 12:58:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 12:58:46,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:46,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 12:58:46,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 12:58:46,075 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-15 12:58:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 12:58:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:46,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667971712] [2023-02-15 12:58:46,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:46,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667971712] [2023-02-15 12:58:46,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667971712] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:46,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 12:58:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052775983] [2023-02-15 12:58:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:58:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:58:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,146 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-15 12:58:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:46,231 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2023-02-15 12:58:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:58:46,232 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-15 12:58:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:46,235 INFO L225 Difference]: With dead ends: 160 [2023-02-15 12:58:46,235 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 12:58:46,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,240 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-15 12:58:46,240 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-15 12:58:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 12:58:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2023-02-15 12:58:46,254 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-15 12:58:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2023-02-15 12:58:46,257 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 3 [2023-02-15 12:58:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:46,257 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2023-02-15 12:58:46,258 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-15 12:58:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2023-02-15 12:58:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 12:58:46,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:46,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:46,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 12:58:46,260 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-15 12:58:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2023-02-15 12:58:46,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:46,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062314664] [2023-02-15 12:58:46,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:46,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:46,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062314664] [2023-02-15 12:58:46,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062314664] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:46,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:46,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:58:46,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964491349] [2023-02-15 12:58:46,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:46,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:58:46,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:46,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:58:46,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:58:46,349 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-15 12:58:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:46,476 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2023-02-15 12:58:46,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:58:46,476 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-15 12:58:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:46,477 INFO L225 Difference]: With dead ends: 146 [2023-02-15 12:58:46,477 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 12:58:46,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:58:46,483 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:58:46,484 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.1s Time] [2023-02-15 12:58:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 12:58:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2023-02-15 12:58:46,495 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-15 12:58:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2023-02-15 12:58:46,498 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 7 [2023-02-15 12:58:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:46,498 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2023-02-15 12:58:46,498 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-15 12:58:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2023-02-15 12:58:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 12:58:46,499 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:46,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:46,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 12:58:46,499 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-15 12:58:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2023-02-15 12:58:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:46,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582853149] [2023-02-15 12:58:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:46,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:46,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582853149] [2023-02-15 12:58:46,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582853149] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:46,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:46,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:58:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901588631] [2023-02-15 12:58:46,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:46,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:58:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:58:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:58:46,599 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-15 12:58:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:46,775 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2023-02-15 12:58:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:58:46,775 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-15 12:58:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:46,776 INFO L225 Difference]: With dead ends: 227 [2023-02-15 12:58:46,776 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 12:58:46,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:58:46,777 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 267 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 12:58:46,777 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-15 12:58:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 12:58:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 172. [2023-02-15 12:58:46,781 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-15 12:58:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2023-02-15 12:58:46,782 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 7 [2023-02-15 12:58:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:46,782 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2023-02-15 12:58:46,782 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-15 12:58:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2023-02-15 12:58:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 12:58:46,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:46,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:46,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 12:58:46,783 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-15 12:58:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:46,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1237592114, now seen corresponding path program 1 times [2023-02-15 12:58:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:46,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690077965] [2023-02-15 12:58:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:46,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:46,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690077965] [2023-02-15 12:58:46,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690077965] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:46,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:46,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:58:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34763416] [2023-02-15 12:58:46,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:46,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:58:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:46,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:58:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,806 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-15 12:58:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:46,828 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2023-02-15 12:58:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:58:46,829 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-15 12:58:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:46,830 INFO L225 Difference]: With dead ends: 186 [2023-02-15 12:58:46,830 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 12:58:46,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,831 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-15 12:58:46,831 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-15 12:58:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 12:58:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2023-02-15 12:58:46,834 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-15 12:58:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2023-02-15 12:58:46,835 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 10 [2023-02-15 12:58:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:46,835 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2023-02-15 12:58:46,835 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-15 12:58:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2023-02-15 12:58:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 12:58:46,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:46,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:46,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 12:58:46,836 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-15 12:58:46,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -288934911, now seen corresponding path program 1 times [2023-02-15 12:58:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:46,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140745627] [2023-02-15 12:58:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:46,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:46,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140745627] [2023-02-15 12:58:46,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140745627] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:46,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:46,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:58:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30209320] [2023-02-15 12:58:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:46,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:58:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:46,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:58:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,859 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-15 12:58:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:46,864 INFO L93 Difference]: Finished difference Result 175 states and 232 transitions. [2023-02-15 12:58:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:58:46,865 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-15 12:58:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:46,865 INFO L225 Difference]: With dead ends: 175 [2023-02-15 12:58:46,865 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 12:58:46,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,866 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-15 12:58:46,866 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-15 12:58:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 12:58:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-02-15 12:58:46,869 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-15 12:58:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 232 transitions. [2023-02-15 12:58:46,869 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 232 transitions. Word has length 14 [2023-02-15 12:58:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:46,870 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 232 transitions. [2023-02-15 12:58:46,870 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-15 12:58:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 232 transitions. [2023-02-15 12:58:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 12:58:46,870 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:46,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:46,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 12:58:46,871 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-15 12:58:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2023-02-15 12:58:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:46,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666466819] [2023-02-15 12:58:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:46,890 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-15 12:58:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:46,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666466819] [2023-02-15 12:58:46,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666466819] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:46,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:46,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:58:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149191838] [2023-02-15 12:58:46,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:46,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:58:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:58:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,892 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-15 12:58:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:46,898 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2023-02-15 12:58:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:58:46,898 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-15 12:58:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:46,899 INFO L225 Difference]: With dead ends: 177 [2023-02-15 12:58:46,899 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 12:58:46,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,900 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-15 12:58:46,900 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-15 12:58:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 12:58:46,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-15 12:58:46,902 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-15 12:58:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2023-02-15 12:58:46,903 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 14 [2023-02-15 12:58:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:46,903 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2023-02-15 12:58:46,903 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-15 12:58:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2023-02-15 12:58:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 12:58:46,904 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:46,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:46,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 12:58:46,905 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-15 12:58:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1556334460, now seen corresponding path program 1 times [2023-02-15 12:58:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:46,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353331686] [2023-02-15 12:58:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:46,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353331686] [2023-02-15 12:58:46,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353331686] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:46,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:46,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:58:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437646585] [2023-02-15 12:58:46,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:46,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:58:46,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:46,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:58:46,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,939 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-15 12:58:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:46,951 INFO L93 Difference]: Finished difference Result 192 states and 243 transitions. [2023-02-15 12:58:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:58:46,951 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-15 12:58:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:46,952 INFO L225 Difference]: With dead ends: 192 [2023-02-15 12:58:46,952 INFO L226 Difference]: Without dead ends: 192 [2023-02-15 12:58:46,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:46,953 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-15 12:58:46,953 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-15 12:58:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-15 12:58:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2023-02-15 12:58:46,955 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-15 12:58:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2023-02-15 12:58:46,956 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 16 [2023-02-15 12:58:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:46,956 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2023-02-15 12:58:46,956 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-15 12:58:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2023-02-15 12:58:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 12:58:46,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:46,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:46,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 12:58:46,957 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-15 12:58:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2023-02-15 12:58:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:46,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619874468] [2023-02-15 12:58:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:47,073 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-15 12:58:47,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:47,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619874468] [2023-02-15 12:58:47,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619874468] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:47,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:47,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 12:58:47,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068048642] [2023-02-15 12:58:47,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:47,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 12:58:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 12:58:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 12:58:47,075 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-15 12:58:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:47,232 INFO L93 Difference]: Finished difference Result 274 states and 343 transitions. [2023-02-15 12:58:47,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 12:58:47,233 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-15 12:58:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:47,234 INFO L225 Difference]: With dead ends: 274 [2023-02-15 12:58:47,234 INFO L226 Difference]: Without dead ends: 274 [2023-02-15 12:58:47,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:58:47,234 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:58:47,234 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.1s Time] [2023-02-15 12:58:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-15 12:58:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 193. [2023-02-15 12:58:47,237 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-15 12:58:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2023-02-15 12:58:47,238 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 16 [2023-02-15 12:58:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:47,238 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2023-02-15 12:58:47,238 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-15 12:58:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2023-02-15 12:58:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 12:58:47,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:47,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:47,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 12:58:47,239 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-15 12:58:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash -508929720, now seen corresponding path program 1 times [2023-02-15 12:58:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:47,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836099656] [2023-02-15 12:58:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:47,342 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-15 12:58:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:47,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836099656] [2023-02-15 12:58:47,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836099656] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:47,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:47,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 12:58:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294132216] [2023-02-15 12:58:47,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:47,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 12:58:47,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:47,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 12:58:47,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 12:58:47,344 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-15 12:58:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:47,495 INFO L93 Difference]: Finished difference Result 273 states and 341 transitions. [2023-02-15 12:58:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:58:47,496 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-15 12:58:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:47,496 INFO L225 Difference]: With dead ends: 273 [2023-02-15 12:58:47,496 INFO L226 Difference]: Without dead ends: 273 [2023-02-15 12:58:47,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-15 12:58:47,497 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:58:47,497 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.1s Time] [2023-02-15 12:58:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-15 12:58:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 228. [2023-02-15 12:58:47,500 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-15 12:58:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 309 transitions. [2023-02-15 12:58:47,501 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 309 transitions. Word has length 17 [2023-02-15 12:58:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:47,501 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 309 transitions. [2023-02-15 12:58:47,501 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-15 12:58:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 309 transitions. [2023-02-15 12:58:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 12:58:47,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:47,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 12:58:47,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 12:58:47,502 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-15 12:58:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:47,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1001745105, now seen corresponding path program 1 times [2023-02-15 12:58:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:47,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111101715] [2023-02-15 12:58:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:47,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:47,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111101715] [2023-02-15 12:58:47,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111101715] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:47,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:47,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:58:47,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435975986] [2023-02-15 12:58:47,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:47,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 12:58:47,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:47,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 12:58:47,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 12:58:47,531 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-15 12:58:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:47,619 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2023-02-15 12:58:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 12:58:47,619 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-15 12:58:47,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:47,620 INFO L225 Difference]: With dead ends: 266 [2023-02-15 12:58:47,620 INFO L226 Difference]: Without dead ends: 266 [2023-02-15 12:58:47,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:58:47,621 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-15 12:58:47,621 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-15 12:58:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-15 12:58:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 229. [2023-02-15 12:58:47,624 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-15 12:58:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 310 transitions. [2023-02-15 12:58:47,625 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 310 transitions. Word has length 17 [2023-02-15 12:58:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:47,625 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 310 transitions. [2023-02-15 12:58:47,625 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-15 12:58:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 310 transitions. [2023-02-15 12:58:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 12:58:47,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:47,626 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-15 12:58:47,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 12:58:47,626 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-15 12:58:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2023-02-15 12:58:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:47,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656721935] [2023-02-15 12:58:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:47,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:47,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656721935] [2023-02-15 12:58:47,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656721935] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:47,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:47,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:58:47,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106653856] [2023-02-15 12:58:47,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:47,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:58:47,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:47,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:58:47,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:58:47,691 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-15 12:58:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:47,785 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2023-02-15 12:58:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 12:58:47,785 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-15 12:58:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:47,786 INFO L225 Difference]: With dead ends: 228 [2023-02-15 12:58:47,786 INFO L226 Difference]: Without dead ends: 228 [2023-02-15 12:58:47,786 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-15 12:58:47,787 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-15 12:58:47,788 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-15 12:58:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-15 12:58:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2023-02-15 12:58:47,791 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-15 12:58:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 308 transitions. [2023-02-15 12:58:47,791 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 308 transitions. Word has length 18 [2023-02-15 12:58:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:47,792 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 308 transitions. [2023-02-15 12:58:47,792 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-15 12:58:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2023-02-15 12:58:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 12:58:47,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:47,793 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-15 12:58:47,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 12:58:47,793 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-15 12:58:47,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2023-02-15 12:58:47,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:47,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035000532] [2023-02-15 12:58:47,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:47,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:47,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:47,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035000532] [2023-02-15 12:58:47,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035000532] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:47,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:47,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:58:47,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295734018] [2023-02-15 12:58:47,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:47,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:58:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:47,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:58:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:58:47,889 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-15 12:58:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:47,996 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2023-02-15 12:58:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 12:58:47,996 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-15 12:58:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:47,997 INFO L225 Difference]: With dead ends: 227 [2023-02-15 12:58:47,997 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 12:58:47,997 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-15 12:58:47,998 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-15 12:58:47,998 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-15 12:58:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 12:58:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-02-15 12:58:48,001 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-15 12:58:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2023-02-15 12:58:48,001 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 18 [2023-02-15 12:58:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:48,002 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2023-02-15 12:58:48,002 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-15 12:58:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2023-02-15 12:58:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 12:58:48,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:48,002 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-15 12:58:48,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 12:58:48,003 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-15 12:58:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:48,003 INFO L85 PathProgramCache]: Analyzing trace with hash 624480237, now seen corresponding path program 1 times [2023-02-15 12:58:48,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:48,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067017584] [2023-02-15 12:58:48,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:48,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:48,060 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-15 12:58:48,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:48,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067017584] [2023-02-15 12:58:48,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067017584] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:48,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:48,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 12:58:48,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282697205] [2023-02-15 12:58:48,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:48,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 12:58:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:48,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 12:58:48,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 12:58:48,062 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-15 12:58:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:48,198 INFO L93 Difference]: Finished difference Result 243 states and 325 transitions. [2023-02-15 12:58:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 12:58:48,199 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-15 12:58:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:48,199 INFO L225 Difference]: With dead ends: 243 [2023-02-15 12:58:48,199 INFO L226 Difference]: Without dead ends: 243 [2023-02-15 12:58:48,200 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-15 12:58:48,200 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-15 12:58:48,200 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-15 12:58:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-15 12:58:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2023-02-15 12:58:48,203 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-15 12:58:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 315 transitions. [2023-02-15 12:58:48,204 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 315 transitions. Word has length 19 [2023-02-15 12:58:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:48,204 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 315 transitions. [2023-02-15 12:58:48,204 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-15 12:58:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 315 transitions. [2023-02-15 12:58:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 12:58:48,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:48,205 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-15 12:58:48,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 12:58:48,205 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-15 12:58:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash 624664935, now seen corresponding path program 1 times [2023-02-15 12:58:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:48,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397202433] [2023-02-15 12:58:48,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:48,286 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-15 12:58:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:48,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397202433] [2023-02-15 12:58:48,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397202433] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:48,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:48,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 12:58:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232864981] [2023-02-15 12:58:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:48,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 12:58:48,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:48,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 12:58:48,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 12:58:48,288 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-15 12:58:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:48,419 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2023-02-15 12:58:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 12:58:48,419 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-15 12:58:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:48,420 INFO L225 Difference]: With dead ends: 236 [2023-02-15 12:58:48,420 INFO L226 Difference]: Without dead ends: 236 [2023-02-15 12:58:48,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 12:58:48,421 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-15 12:58:48,421 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-15 12:58:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-15 12:58:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 206. [2023-02-15 12:58:48,423 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-15 12:58:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 265 transitions. [2023-02-15 12:58:48,424 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 265 transitions. Word has length 19 [2023-02-15 12:58:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:48,424 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 265 transitions. [2023-02-15 12:58:48,424 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-15 12:58:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 265 transitions. [2023-02-15 12:58:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 12:58:48,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:48,425 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-15 12:58:48,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 12:58:48,425 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-15 12:58:48,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1555885541, now seen corresponding path program 1 times [2023-02-15 12:58:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:48,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453286377] [2023-02-15 12:58:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:48,445 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-15 12:58:48,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:48,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453286377] [2023-02-15 12:58:48,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453286377] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:48,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:48,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 12:58:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716913799] [2023-02-15 12:58:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:48,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 12:58:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 12:58:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:48,447 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-15 12:58:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:48,452 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2023-02-15 12:58:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 12:58:48,453 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-15 12:58:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:48,453 INFO L225 Difference]: With dead ends: 181 [2023-02-15 12:58:48,454 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 12:58:48,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 12:58:48,454 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-15 12:58:48,454 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-15 12:58:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 12:58:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2023-02-15 12:58:48,456 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-15 12:58:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 214 transitions. [2023-02-15 12:58:48,457 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 214 transitions. Word has length 20 [2023-02-15 12:58:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:48,457 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 214 transitions. [2023-02-15 12:58:48,457 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-15 12:58:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 214 transitions. [2023-02-15 12:58:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 12:58:48,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:48,458 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-15 12:58:48,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 12:58:48,458 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-15 12:58:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 987811916, now seen corresponding path program 1 times [2023-02-15 12:58:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:48,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659786568] [2023-02-15 12:58:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:48,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:48,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:48,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659786568] [2023-02-15 12:58:48,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659786568] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:58:48,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478292829] [2023-02-15 12:58:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:48,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:58:48,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:58:48,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:58:48,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 12:58:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:48,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 12:58:48,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:58:48,684 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-15 12:58:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:48,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:58:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:48,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478292829] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:58:48,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:58:48,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-15 12:58:48,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897846597] [2023-02-15 12:58:48,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:58:48,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 12:58:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:48,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 12:58:48,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 12:58:48,730 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-15 12:58:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:48,869 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2023-02-15 12:58:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 12:58:48,869 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-15 12:58:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:48,870 INFO L225 Difference]: With dead ends: 189 [2023-02-15 12:58:48,870 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 12:58:48,870 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-15 12:58:48,870 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 12:58:48,870 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.1s Time] [2023-02-15 12:58:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 12:58:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2023-02-15 12:58:48,872 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-15 12:58:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2023-02-15 12:58:48,873 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 21 [2023-02-15 12:58:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:48,873 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2023-02-15 12:58:48,873 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-15 12:58:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2023-02-15 12:58:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 12:58:48,873 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:48,873 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-15 12:58:48,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 12:58:49,078 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-15 12:58:49,079 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-15 12:58:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2023-02-15 12:58:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:49,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917737656] [2023-02-15 12:58:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:49,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917737656] [2023-02-15 12:58:49,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917737656] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:49,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:49,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:58:49,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760137353] [2023-02-15 12:58:49,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:49,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:58:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:58:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:58:49,186 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-15 12:58:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:49,370 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2023-02-15 12:58:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:58:49,370 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-15 12:58:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:49,371 INFO L225 Difference]: With dead ends: 172 [2023-02-15 12:58:49,371 INFO L226 Difference]: Without dead ends: 172 [2023-02-15 12:58:49,371 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-15 12:58:49,371 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-15 12:58:49,371 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-15 12:58:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-15 12:58:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2023-02-15 12:58:49,373 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-15 12:58:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2023-02-15 12:58:49,374 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 21 [2023-02-15 12:58:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:49,374 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2023-02-15 12:58:49,374 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-15 12:58:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2023-02-15 12:58:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 12:58:49,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:49,374 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-15 12:58:49,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 12:58:49,374 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-15 12:58:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2023-02-15 12:58:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:49,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207732842] [2023-02-15 12:58:49,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:49,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:49,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:49,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207732842] [2023-02-15 12:58:49,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207732842] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:49,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:49,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:58:49,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122068985] [2023-02-15 12:58:49,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:49,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:58:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:58:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:58:49,541 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-15 12:58:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:49,766 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2023-02-15 12:58:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:58:49,767 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-15 12:58:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:49,767 INFO L225 Difference]: With dead ends: 171 [2023-02-15 12:58:49,767 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 12:58:49,767 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-15 12:58:49,768 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 89 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 12:58:49,768 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-15 12:58:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 12:58:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2023-02-15 12:58:49,770 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-15 12:58:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2023-02-15 12:58:49,770 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 21 [2023-02-15 12:58:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:49,770 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2023-02-15 12:58:49,770 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-15 12:58:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2023-02-15 12:58:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 12:58:49,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:49,771 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-15 12:58:49,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 12:58:49,771 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-15 12:58:49,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2023-02-15 12:58:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:49,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66737832] [2023-02-15 12:58:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66737832] [2023-02-15 12:58:49,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66737832] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:49,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:49,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:58:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880539838] [2023-02-15 12:58:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:49,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:58:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:49,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:58:49,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:58:49,855 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-15 12:58:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:49,952 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2023-02-15 12:58:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 12:58:49,953 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-15 12:58:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:49,953 INFO L225 Difference]: With dead ends: 168 [2023-02-15 12:58:49,953 INFO L226 Difference]: Without dead ends: 168 [2023-02-15 12:58:49,953 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-15 12:58:49,954 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-15 12:58:49,954 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-15 12:58:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-15 12:58:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-02-15 12:58:49,956 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-15 12:58:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2023-02-15 12:58:49,956 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 22 [2023-02-15 12:58:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:49,956 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2023-02-15 12:58:49,956 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-15 12:58:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2023-02-15 12:58:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 12:58:49,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:49,957 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-15 12:58:49,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 12:58:49,957 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-15 12:58:49,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2023-02-15 12:58:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:49,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503809395] [2023-02-15 12:58:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:50,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:50,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503809395] [2023-02-15 12:58:50,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503809395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:50,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:50,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 12:58:50,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253538937] [2023-02-15 12:58:50,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:50,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 12:58:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:50,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 12:58:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 12:58:50,050 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-15 12:58:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:50,160 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2023-02-15 12:58:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 12:58:50,161 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-15 12:58:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:50,161 INFO L225 Difference]: With dead ends: 167 [2023-02-15 12:58:50,161 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 12:58:50,161 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-15 12:58:50,162 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-15 12:58:50,162 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-15 12:58:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 12:58:50,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2023-02-15 12:58:50,164 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-15 12:58:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2023-02-15 12:58:50,164 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 22 [2023-02-15 12:58:50,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:50,164 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2023-02-15 12:58:50,165 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-15 12:58:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2023-02-15 12:58:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 12:58:50,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:50,165 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-15 12:58:50,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 12:58:50,165 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-15 12:58:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2023-02-15 12:58:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:50,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493214347] [2023-02-15 12:58:50,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:50,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:50,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493214347] [2023-02-15 12:58:50,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493214347] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:50,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:50,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:58:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087698015] [2023-02-15 12:58:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:50,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:58:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:50,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:58:50,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:58:50,284 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-15 12:58:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:50,487 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2023-02-15 12:58:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:58:50,489 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-15 12:58:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:50,489 INFO L225 Difference]: With dead ends: 168 [2023-02-15 12:58:50,489 INFO L226 Difference]: Without dead ends: 168 [2023-02-15 12:58:50,489 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-15 12:58:50,490 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 12:58:50,490 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-15 12:58:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-15 12:58:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2023-02-15 12:58:50,491 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-15 12:58:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2023-02-15 12:58:50,492 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 25 [2023-02-15 12:58:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:50,492 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2023-02-15 12:58:50,492 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-15 12:58:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2023-02-15 12:58:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 12:58:50,492 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:50,492 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-15 12:58:50,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 12:58:50,493 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-15 12:58:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2023-02-15 12:58:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:50,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597727641] [2023-02-15 12:58:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:50,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 12:58:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597727641] [2023-02-15 12:58:50,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597727641] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:58:50,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:58:50,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 12:58:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236114217] [2023-02-15 12:58:50,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:58:50,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 12:58:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:50,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 12:58:50,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 12:58:50,680 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-15 12:58:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:50,860 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2023-02-15 12:58:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 12:58:50,861 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-15 12:58:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:50,861 INFO L225 Difference]: With dead ends: 167 [2023-02-15 12:58:50,861 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 12:58:50,862 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-15 12:58:50,862 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-15 12:58:50,862 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-15 12:58:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 12:58:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2023-02-15 12:58:50,864 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-15 12:58:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 195 transitions. [2023-02-15 12:58:50,864 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 195 transitions. Word has length 25 [2023-02-15 12:58:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:50,864 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 195 transitions. [2023-02-15 12:58:50,864 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-15 12:58:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 195 transitions. [2023-02-15 12:58:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 12:58:50,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:50,865 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-15 12:58:50,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 12:58:50,865 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-15 12:58:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2023-02-15 12:58:50,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:50,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813307967] [2023-02-15 12:58:50,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:51,505 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-15 12:58:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813307967] [2023-02-15 12:58:51,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813307967] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:58:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689846384] [2023-02-15 12:58:51,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:58:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:58:51,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:58:51,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 12:58:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:51,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 12:58:51,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:58:51,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 12:58:51,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 12:58:51,976 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-15 12:58:51,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:58:52,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:52,199 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-15 12:58:52,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:52,208 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-15 12:58:52,434 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-15 12:58:52,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689846384] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:58:52,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:58:52,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 33 [2023-02-15 12:58:52,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554440881] [2023-02-15 12:58:52,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:58:52,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 12:58:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:52,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 12:58:52,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 12:58:52,436 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-15 12:58:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:54,137 INFO L93 Difference]: Finished difference Result 319 states and 372 transitions. [2023-02-15 12:58:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 12:58:54,137 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-15 12:58:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:54,138 INFO L225 Difference]: With dead ends: 319 [2023-02-15 12:58:54,138 INFO L226 Difference]: Without dead ends: 319 [2023-02-15 12:58:54,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=973, Invalid=3059, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 12:58:54,140 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1044 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2023-02-15 12:58:54,140 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.6s Time] [2023-02-15 12:58:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-02-15 12:58:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 189. [2023-02-15 12:58:54,142 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-15 12:58:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2023-02-15 12:58:54,143 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 38 [2023-02-15 12:58:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:54,143 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2023-02-15 12:58:54,143 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-15 12:58:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2023-02-15 12:58:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 12:58:54,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:54,143 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-15 12:58:54,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 12:58:54,349 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-15 12:58:54,349 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-15 12:58:54,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2023-02-15 12:58:54,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:54,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982896709] [2023-02-15 12:58:54,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:54,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:54,700 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-15 12:58:54,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:54,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982896709] [2023-02-15 12:58:54,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982896709] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:58:54,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676962724] [2023-02-15 12:58:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:54,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:58:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:58:54,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:58:54,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 12:58:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:54,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 12:58:54,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:58:55,017 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:58:55,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 12:58:55,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:58:55,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 12:58:55,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 12:58:55,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 12:58:55,153 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:58:55,154 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-15 12:58:55,160 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-15 12:58:55,213 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:58:55,214 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-15 12:58:55,219 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-15 12:58:55,274 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-15 12:58:55,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 12:58:55,280 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-15 12:58:55,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:58:55,343 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-15 12:58:55,360 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-15 12:58:55,371 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-15 12:58:55,387 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-15 12:58:55,697 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:55,698 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-15 12:58:55,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:55,711 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-15 12:58:55,754 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-02-15 12:58:55,754 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-15 12:58:55,761 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-15 12:58:55,774 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-02-15 12:58:55,774 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-15 12:58:55,777 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-15 12:58:55,781 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-15 12:58:55,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:55,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 266 [2023-02-15 12:58:55,800 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-15 12:58:55,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 227 [2023-02-15 12:58:55,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:55,819 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-15 12:58:55,976 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-15 12:58:55,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676962724] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:58:55,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:58:55,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2023-02-15 12:58:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122467389] [2023-02-15 12:58:55,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:58:55,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 12:58:55,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:58:55,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 12:58:55,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=717, Unknown=15, NotChecked=236, Total=1122 [2023-02-15 12:58:55,978 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-15 12:58:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:58:57,384 INFO L93 Difference]: Finished difference Result 392 states and 460 transitions. [2023-02-15 12:58:57,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 12:58:57,385 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-15 12:58:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:58:57,386 INFO L225 Difference]: With dead ends: 392 [2023-02-15 12:58:57,386 INFO L226 Difference]: Without dead ends: 392 [2023-02-15 12:58:57,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=1684, Unknown=15, NotChecked=372, Total=2550 [2023-02-15 12:58:57,387 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 695 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 12:58:57,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1213 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1207 Invalid, 0 Unknown, 853 Unchecked, 0.8s Time] [2023-02-15 12:58:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-02-15 12:58:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 224. [2023-02-15 12:58:57,390 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-15 12:58:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 267 transitions. [2023-02-15 12:58:57,390 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 267 transitions. Word has length 38 [2023-02-15 12:58:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:58:57,391 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 267 transitions. [2023-02-15 12:58:57,391 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-15 12:58:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 267 transitions. [2023-02-15 12:58:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 12:58:57,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:58:57,392 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-15 12:58:57,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 12:58:57,595 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-15 12:58:57,596 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-15 12:58:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:58:57,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589588, now seen corresponding path program 1 times [2023-02-15 12:58:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:58:57,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277377068] [2023-02-15 12:58:57,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:58:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:57,862 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-15 12:58:57,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:58:57,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277377068] [2023-02-15 12:58:57,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277377068] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:58:57,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802629288] [2023-02-15 12:58:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:58:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:58:57,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:58:57,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:58:57,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 12:58:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:58:57,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 12:58:57,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:58:58,036 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:58:58,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 12:58:58,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 12:58:58,124 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:58:58,124 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-15 12:58:58,159 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:58:58,159 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-15 12:58:58,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 12:58:58,247 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-15 12:58:58,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:58:58,277 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-02-15 12:58:58,277 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-15 12:58:58,296 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .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-15 12:58:58,300 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-15 12:58:58,304 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-15 12:58:58,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:58,309 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-15 12:58:58,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:58,316 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-15 12:58:58,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:58:58,324 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-15 12:58:58,327 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-15 12:59:03,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:03,333 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 34 treesize of output 50 [2023-02-15 12:59:03,345 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-15 12:59:03,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802629288] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:59:03,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:59:03,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2023-02-15 12:59:03,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320564649] [2023-02-15 12:59:03,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:59:03,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 12:59:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:59:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 12:59:03,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=507, Unknown=6, NotChecked=144, Total=756 [2023-02-15 12:59:03,348 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-15 12:59:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:59:04,091 INFO L93 Difference]: Finished difference Result 407 states and 488 transitions. [2023-02-15 12:59:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 12:59:04,091 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-15 12:59:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:59:04,092 INFO L225 Difference]: With dead ends: 407 [2023-02-15 12:59:04,093 INFO L226 Difference]: Without dead ends: 407 [2023-02-15 12:59:04,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=997, Unknown=6, NotChecked=210, Total=1482 [2023-02-15 12:59:04,093 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 569 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 720 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 12:59:04,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 885 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1233 Invalid, 0 Unknown, 720 Unchecked, 0.5s Time] [2023-02-15 12:59:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-02-15 12:59:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 318. [2023-02-15 12:59:04,097 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-15 12:59:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 400 transitions. [2023-02-15 12:59:04,098 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 400 transitions. Word has length 39 [2023-02-15 12:59:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:59:04,098 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 400 transitions. [2023-02-15 12:59:04,098 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-15 12:59:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 400 transitions. [2023-02-15 12:59:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 12:59:04,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:59:04,098 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-15 12:59:04,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 12:59:04,299 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-15 12:59:04,299 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-15 12:59:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:59:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1594589587, now seen corresponding path program 1 times [2023-02-15 12:59:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:59:04,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813996777] [2023-02-15 12:59:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:59:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:59:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:59:04,650 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-15 12:59:04,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:59:04,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813996777] [2023-02-15 12:59:04,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813996777] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:59:04,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547364328] [2023-02-15 12:59:04,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:59:04,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:59:04,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:59:04,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:59:04,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 12:59:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:59:04,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 12:59:04,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:59:04,826 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 12:59:04,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 12:59:04,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 12:59:04,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 12:59:04,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 12:59:04,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:59:04,928 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-15 12:59:04,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 12:59:04,974 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:59:04,975 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-15 12:59:04,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 12:59:05,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 12:59:05,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 12:59:05,109 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-15 12:59:05,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:59:05,238 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_697 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_697) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| 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| |c_ULTIMATE.start_main_#t~mem16#1.base| 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-15 12:59:05,243 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-15 12:59:05,265 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-15 12:59:05,275 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-15 12:59:05,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:05,285 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-15 12:59:05,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:05,289 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-15 12:59:05,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:05,297 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-15 12:59:05,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:05,307 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-15 12:59:05,310 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-15 12:59:05,313 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-15 12:59:05,316 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-15 12:59:05,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:05,323 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-15 12:59:10,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:10,154 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-15 12:59:10,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:10,159 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-15 12:59:10,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:59:10,162 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-15 12:59:10,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:59:10,165 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-15 12:59:10,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:10,266 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 34 treesize of output 50 [2023-02-15 12:59:10,278 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-15 12:59:10,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547364328] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 12:59:10,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 12:59:10,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-02-15 12:59:10,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903645051] [2023-02-15 12:59:10,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 12:59:10,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 12:59:10,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:59:10,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 12:59:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=748, Unknown=4, NotChecked=236, Total=1122 [2023-02-15 12:59:10,280 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-15 12:59:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:59:41,265 INFO L93 Difference]: Finished difference Result 488 states and 580 transitions. [2023-02-15 12:59:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 12:59:41,265 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-15 12:59:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:59:41,267 INFO L225 Difference]: With dead ends: 488 [2023-02-15 12:59:41,267 INFO L226 Difference]: Without dead ends: 488 [2023-02-15 12:59:41,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=640, Invalid=2333, Unknown=13, NotChecked=436, Total=3422 [2023-02-15 12:59:41,268 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 1138 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 99 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 961 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-15 12:59:41,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1253 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1666 Invalid, 6 Unknown, 961 Unchecked, 4.8s Time] [2023-02-15 12:59:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-02-15 12:59:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 321. [2023-02-15 12:59:41,271 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-15 12:59:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 409 transitions. [2023-02-15 12:59:41,272 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 409 transitions. Word has length 39 [2023-02-15 12:59:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:59:41,272 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 409 transitions. [2023-02-15 12:59:41,272 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-15 12:59:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2023-02-15 12:59:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 12:59:41,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:59:41,273 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-15 12:59:41,291 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-15 12:59:41,477 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-15 12:59:41,478 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-15 12:59:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:59:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1594404890, now seen corresponding path program 1 times [2023-02-15 12:59:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:59:41,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475381162] [2023-02-15 12:59:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:59:41,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:59:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:59:41,755 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-15 12:59:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:59:41,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475381162] [2023-02-15 12:59:41,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475381162] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:59:41,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:59:41,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 12:59:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982252910] [2023-02-15 12:59:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:59:41,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 12:59:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:59:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 12:59:41,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 12:59:41,756 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-15 12:59:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:59:42,363 INFO L93 Difference]: Finished difference Result 321 states and 406 transitions. [2023-02-15 12:59:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 12:59:42,363 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-15 12:59:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:59:42,364 INFO L225 Difference]: With dead ends: 321 [2023-02-15 12:59:42,364 INFO L226 Difference]: Without dead ends: 321 [2023-02-15 12:59:42,364 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-15 12:59:42,364 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 12:59:42,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 258 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 12:59:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-02-15 12:59:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2023-02-15 12:59:42,368 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-15 12:59:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 403 transitions. [2023-02-15 12:59:42,368 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 403 transitions. Word has length 39 [2023-02-15 12:59:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:59:42,368 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 403 transitions. [2023-02-15 12:59:42,368 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-15 12:59:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 403 transitions. [2023-02-15 12:59:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 12:59:42,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:59:42,369 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-15 12:59:42,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 12:59:42,369 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-15 12:59:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:59:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1677406060, now seen corresponding path program 1 times [2023-02-15 12:59:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:59:42,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147323401] [2023-02-15 12:59:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:59:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:59:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:59:43,557 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-15 12:59:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:59:43,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147323401] [2023-02-15 12:59:43,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147323401] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:59:43,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:59:43,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 12:59:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327651653] [2023-02-15 12:59:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:59:43,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 12:59:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:59:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 12:59:43,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-15 12:59:43,559 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-15 12:59:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:59:46,645 INFO L93 Difference]: Finished difference Result 442 states and 541 transitions. [2023-02-15 12:59:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 12:59:46,646 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-15 12:59:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:59:46,647 INFO L225 Difference]: With dead ends: 442 [2023-02-15 12:59:46,647 INFO L226 Difference]: Without dead ends: 442 [2023-02-15 12:59:46,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2023-02-15 12:59:46,648 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 209 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 12:59:46,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 779 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-15 12:59:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-02-15 12:59:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 326. [2023-02-15 12:59:46,651 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-15 12:59:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 420 transitions. [2023-02-15 12:59:46,652 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 420 transitions. Word has length 39 [2023-02-15 12:59:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:59:46,652 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 420 transitions. [2023-02-15 12:59:46,652 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-15 12:59:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 420 transitions. [2023-02-15 12:59:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 12:59:46,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:59:46,652 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-15 12:59:46,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-15 12:59:46,653 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-15 12:59:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:59:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash 982584715, now seen corresponding path program 1 times [2023-02-15 12:59:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:59:46,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774030285] [2023-02-15 12:59:46,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:59:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:59:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:59:47,402 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-15 12:59:47,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:59:47,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774030285] [2023-02-15 12:59:47,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774030285] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 12:59:47,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 12:59:47,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 12:59:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464890509] [2023-02-15 12:59:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 12:59:47,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 12:59:47,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 12:59:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 12:59:47,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-15 12:59:47,403 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-15 12:59:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 12:59:49,591 INFO L93 Difference]: Finished difference Result 533 states and 657 transitions. [2023-02-15 12:59:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 12:59:49,592 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-15 12:59:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 12:59:49,593 INFO L225 Difference]: With dead ends: 533 [2023-02-15 12:59:49,593 INFO L226 Difference]: Without dead ends: 529 [2023-02-15 12:59:49,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2023-02-15 12:59:49,593 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 268 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 12:59:49,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 605 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-15 12:59:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-02-15 12:59:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 362. [2023-02-15 12:59:49,598 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-15 12:59:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 465 transitions. [2023-02-15 12:59:49,599 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 465 transitions. Word has length 41 [2023-02-15 12:59:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 12:59:49,599 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 465 transitions. [2023-02-15 12:59:49,599 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-15 12:59:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 465 transitions. [2023-02-15 12:59:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 12:59:49,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 12:59:49,600 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-15 12:59:49,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-15 12:59:49,600 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-15 12:59:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 12:59:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341771, now seen corresponding path program 1 times [2023-02-15 12:59:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 12:59:49,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324130524] [2023-02-15 12:59:49,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:59:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 12:59:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:59:50,471 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-15 12:59:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 12:59:50,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324130524] [2023-02-15 12:59:50,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324130524] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 12:59:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685469197] [2023-02-15 12:59:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 12:59:50,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 12:59:50,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 12:59:50,473 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 12:59:50,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 12:59:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 12:59:50,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 12:59:50,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 12:59:51,106 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 12:59:51,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 12:59:51,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 12:59:51,589 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:59:51,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-15 12:59:51,823 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 12:59:51,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-15 12:59:52,590 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 12:59:52,592 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-15 12:59:52,803 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-15 12:59:52,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 12:59:56,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:56,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2023-02-15 12:59:56,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:56,426 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-15 12:59:56,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 12:59:56,465 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-15 12:59:56,473 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-15 13:00:03,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:03,153 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-15 13:00:07,711 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-15 13:00:07,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685469197] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:00:07,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:00:07,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2023-02-15 13:00:07,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078150029] [2023-02-15 13:00:07,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:00:07,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 13:00:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:00:07,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 13:00:07,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=980, Unknown=24, NotChecked=0, Total=1190 [2023-02-15 13:00:07,713 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-15 13:00:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:00:16,261 INFO L93 Difference]: Finished difference Result 675 states and 859 transitions. [2023-02-15 13:00:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:00:16,261 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-15 13:00:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:00:16,263 INFO L225 Difference]: With dead ends: 675 [2023-02-15 13:00:16,263 INFO L226 Difference]: Without dead ends: 675 [2023-02-15 13:00:16,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=444, Invalid=1788, Unknown=24, NotChecked=0, Total=2256 [2023-02-15 13:00:16,264 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 853 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:00:16,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1486 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-02-15 13:00:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2023-02-15 13:00:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 472. [2023-02-15 13:00:16,270 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-15 13:00:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 614 transitions. [2023-02-15 13:00:16,271 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 614 transitions. Word has length 41 [2023-02-15 13:00:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:00:16,271 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 614 transitions. [2023-02-15 13:00:16,271 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-15 13:00:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 614 transitions. [2023-02-15 13:00:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:00:16,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:00:16,272 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-15 13:00:16,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:00:16,477 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-15 13:00:16,477 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-15 13:00:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:00:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1454341772, now seen corresponding path program 1 times [2023-02-15 13:00:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:00:16,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783306235] [2023-02-15 13:00:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:00:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:00:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:00:19,560 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-15 13:00:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:00:19,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783306235] [2023-02-15 13:00:19,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783306235] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:00:19,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416238009] [2023-02-15 13:00:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:00:19,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:00:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:00:19,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:00:19,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:00:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:00:19,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 13:00:19,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:00:20,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:00:20,549 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:00:20,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:00:20,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:00:20,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:00:21,418 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:00:21,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-15 13:00:21,445 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-15 13:00:21,819 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:00:21,819 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-15 13:00:21,828 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-15 13:00:23,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:00:23,145 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-15 13:00:23,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:00:23,156 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-15 13:00:23,479 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-15 13:00:23,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:00:25,442 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-15 13:00:26,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:26,090 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-15 13:00:26,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:26,107 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-15 13:00:26,116 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-15 13:00:26,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:26,155 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-15 13:00:26,166 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-15 13:00:26,175 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-15 13:00:26,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-02-15 13:00:26,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:26,456 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-15 13:00:26,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:26,474 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-15 13:00:26,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:00:26,481 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:00:26,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:26,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:26,493 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-15 13:00:26,499 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:00:26,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:26,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:00:26,511 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-15 13:00:26,521 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-15 13:00:28,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:00:28,382 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-15 13:00:29,035 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-15 13:00:29,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416238009] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:00:29,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:00:29,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 14] total 43 [2023-02-15 13:00:29,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000943787] [2023-02-15 13:00:29,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:00:29,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 13:00:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:00:29,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 13:00:29,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1606, Unknown=18, NotChecked=82, Total=1892 [2023-02-15 13:00:29,038 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-15 13:01:04,146 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-15 13:01:06,190 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-15 13:01:11,985 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-15 13:01:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:20,986 INFO L93 Difference]: Finished difference Result 1798 states and 2221 transitions. [2023-02-15 13:01:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-02-15 13:01:20,986 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-15 13:01:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:20,990 INFO L225 Difference]: With dead ends: 1798 [2023-02-15 13:01:20,990 INFO L226 Difference]: Without dead ends: 1798 [2023-02-15 13:01:20,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4916 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=2934, Invalid=13561, Unknown=21, NotChecked=254, Total=16770 [2023-02-15 13:01:20,995 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 3996 mSDsluCounter, 2579 mSDsCounter, 0 mSdLazyCounter, 4653 mSolverCounterSat, 489 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 5580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 4653 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:20,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 2720 Invalid, 5580 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [489 Valid, 4653 Invalid, 3 Unknown, 435 Unchecked, 23.6s Time] [2023-02-15 13:01:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2023-02-15 13:01:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 888. [2023-02-15 13:01:21,026 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-15 13:01:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1190 transitions. [2023-02-15 13:01:21,028 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1190 transitions. Word has length 41 [2023-02-15 13:01:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:21,028 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 1190 transitions. [2023-02-15 13:01:21,028 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-15 13:01:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1190 transitions. [2023-02-15 13:01:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:01:21,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:21,029 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-15 13:01:21,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 13:01:21,234 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-15 13:01:21,234 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-15 13:01:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1351336816, now seen corresponding path program 1 times [2023-02-15 13:01:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:21,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247093225] [2023-02-15 13:01:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:22,130 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-15 13:01:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247093225] [2023-02-15 13:01:22,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247093225] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:22,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:22,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 13:01:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787702244] [2023-02-15 13:01:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:22,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 13:01:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:01:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 13:01:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:01:22,131 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-15 13:01:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:25,448 INFO L93 Difference]: Finished difference Result 1204 states and 1584 transitions. [2023-02-15 13:01:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:01:25,450 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-15 13:01:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:25,453 INFO L225 Difference]: With dead ends: 1204 [2023-02-15 13:01:25,453 INFO L226 Difference]: Without dead ends: 1198 [2023-02-15 13:01:25,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:01:25,453 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 255 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:25,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 782 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-02-15 13:01:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2023-02-15 13:01:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 866. [2023-02-15 13:01:25,493 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-15 13:01:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1157 transitions. [2023-02-15 13:01:25,495 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1157 transitions. Word has length 43 [2023-02-15 13:01:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:25,495 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1157 transitions. [2023-02-15 13:01:25,495 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-15 13:01:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1157 transitions. [2023-02-15 13:01:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:01:25,496 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:25,496 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-15 13:01:25,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-15 13:01:25,496 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-15 13:01:25,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -556665744, now seen corresponding path program 1 times [2023-02-15 13:01:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:25,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824095747] [2023-02-15 13:01:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:26,314 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-15 13:01:26,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:26,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824095747] [2023-02-15 13:01:26,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824095747] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:01:26,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:01:26,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 13:01:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472806551] [2023-02-15 13:01:26,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:01:26,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:01:26,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:01:26,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:01:26,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:01:26,315 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-15 13:01:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:01:29,208 INFO L93 Difference]: Finished difference Result 1243 states and 1649 transitions. [2023-02-15 13:01:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 13:01:29,225 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-15 13:01:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:01:29,228 INFO L225 Difference]: With dead ends: 1243 [2023-02-15 13:01:29,228 INFO L226 Difference]: Without dead ends: 1243 [2023-02-15 13:01:29,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:01:29,228 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 306 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:01:29,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 679 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-15 13:01:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-02-15 13:01:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 866. [2023-02-15 13:01:29,237 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-15 13:01:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1153 transitions. [2023-02-15 13:01:29,238 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1153 transitions. Word has length 43 [2023-02-15 13:01:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:01:29,238 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1153 transitions. [2023-02-15 13:01:29,238 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-15 13:01:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1153 transitions. [2023-02-15 13:01:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:01:29,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:01:29,239 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-15 13:01:29,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-15 13:01:29,239 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-15 13:01:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:01:29,240 INFO L85 PathProgramCache]: Analyzing trace with hash -659312340, now seen corresponding path program 1 times [2023-02-15 13:01:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:01:29,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604308196] [2023-02-15 13:01:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:29,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:01:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:30,210 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-15 13:01:30,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:01:30,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604308196] [2023-02-15 13:01:30,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604308196] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:01:30,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860523452] [2023-02-15 13:01:30,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:01:30,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:01:30,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:01:30,212 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:01:30,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:01:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:01:30,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 13:01:30,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:01:31,078 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:01:31,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:01:31,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:01:31,635 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:01:31,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-15 13:01:31,904 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:01:31,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-15 13:01:32,562 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:01:32,562 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-15 13:01:32,778 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-15 13:01:32,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:01:38,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:01:38,646 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-15 13:01:38,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:01:38,684 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-15 13:01:38,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:01:38,722 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-15 13:01:38,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2023-02-15 13:01:47,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:01:47,921 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-15 13:02:02,419 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-15 13:02:02,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860523452] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:02:02,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:02:02,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 34 [2023-02-15 13:02:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180295886] [2023-02-15 13:02:02,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:02:02,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 13:02:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:02:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 13:02:02,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=961, Unknown=19, NotChecked=0, Total=1190 [2023-02-15 13:02:02,421 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-15 13:02:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:02:09,078 INFO L93 Difference]: Finished difference Result 1253 states and 1667 transitions. [2023-02-15 13:02:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:02:09,079 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-15 13:02:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:02:09,081 INFO L225 Difference]: With dead ends: 1253 [2023-02-15 13:02:09,081 INFO L226 Difference]: Without dead ends: 1253 [2023-02-15 13:02:09,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=351, Invalid=1352, Unknown=19, NotChecked=0, Total=1722 [2023-02-15 13:02:09,082 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 760 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:02:09,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1119 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-02-15 13:02:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2023-02-15 13:02:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 870. [2023-02-15 13:02:09,094 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-15 13:02:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1159 transitions. [2023-02-15 13:02:09,095 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1159 transitions. Word has length 46 [2023-02-15 13:02:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:02:09,095 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 1159 transitions. [2023-02-15 13:02:09,095 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-15 13:02:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1159 transitions. [2023-02-15 13:02:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:02:09,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:02:09,096 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-15 13:02:09,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:02:09,301 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-15 13:02:09,302 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-15 13:02:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:02:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -659312339, now seen corresponding path program 1 times [2023-02-15 13:02:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:02:09,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691790503] [2023-02-15 13:02:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:02:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:02:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:02:13,312 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-15 13:02:13,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:02:13,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691790503] [2023-02-15 13:02:13,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691790503] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:02:13,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538534698] [2023-02-15 13:02:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:02:13,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:02:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:02:13,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:02:13,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:02:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:02:13,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-15 13:02:13,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:02:14,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:02:14,478 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:02:14,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:02:14,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:02:14,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:02:15,266 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:02:15,267 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-15 13:02:15,291 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-15 13:02:15,629 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:02:15,629 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-15 13:02:15,639 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-15 13:02:16,657 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:02:16,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 13:02:16,673 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:02:16,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:02:16,681 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-15 13:02:16,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-15 13:02:16,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:02:19,176 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_85| Int) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_85| |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_1247) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1249) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |v_ULTIMATE.start_main_~n~0#1.offset_85| 4))) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_85|)))) (forall ((v_ArrVal_1249 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_85| Int) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1247 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_85| |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_1248))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0)) (.cse2 (+ |v_ULTIMATE.start_main_~n~0#1.offset_85| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1247) .cse1 v_ArrVal_1249) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1250) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))))) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_85|)))))) is different from false [2023-02-15 13:02:19,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:02:19,908 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-15 13:02:19,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:02:19,925 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-15 13:02:19,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-02-15 13:02:19,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:02:19,974 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-15 13:02:19,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 74 treesize of output 58 [2023-02-15 13:02:19,994 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-15 13:02:20,005 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-15 13:02:20,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:02:20,334 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-15 13:02:20,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:02:20,353 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-15 13:02:20,362 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:02:20,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:02:20,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:02:20,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:02:20,375 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-15 13:02:20,380 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:02:20,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:02:20,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:02:20,392 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-15 13:02:20,402 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-15 13:02:22,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:02:22,178 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-15 13:02:23,632 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-15 13:02:23,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538534698] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:02:23,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:02:23,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 15] total 51 [2023-02-15 13:02:23,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592606251] [2023-02-15 13:02:23,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:02:23,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 13:02:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:02:23,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 13:02:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2189, Unknown=21, NotChecked=98, Total=2652 [2023-02-15 13:02:23,634 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)