./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.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 fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:41:07,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:41:07,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:41:07,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:41:07,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:41:07,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:41:07,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:41:07,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:41:07,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:41:07,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:41:07,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:41:07,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:41:07,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:41:07,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:41:07,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:41:07,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:41:07,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:41:07,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:41:07,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:41:07,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:41:07,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:41:07,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:41:07,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:41:07,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:41:07,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:41:07,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:41:07,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:41:07,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:41:07,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:41:07,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:41:07,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:41:07,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:41:07,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:41:07,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:41:07,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:41:07,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:41:07,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:41:07,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:41:07,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:41:07,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:41:07,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:41:07,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:41:07,640 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:41:07,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:41:07,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:41:07,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:41:07,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:41:07,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:41:07,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:41:07,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:41:07,642 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:41:07,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:41:07,643 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:41:07,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:41:07,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:41:07,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:41:07,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:41:07,644 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:41:07,644 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:41:07,644 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:41:07,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:41:07,644 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:41:07,645 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:41:07,645 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:41:07,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:41:07,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:41:07,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:41:07,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:41:07,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:41:07,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:41:07,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:41:07,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:41:07,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:41:07,647 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:41:07,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:41:07,647 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:41:07,647 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2023-02-15 01:41:07,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:41:07,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:41:07,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:41:07,846 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:41:07,847 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:41:07,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2023-02-15 01:41:09,034 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:41:09,258 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:41:09,258 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2023-02-15 01:41:09,273 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df3a159d/9349b7e80018443c96c581e03760d8f9/FLAG989f3b994 [2023-02-15 01:41:09,287 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df3a159d/9349b7e80018443c96c581e03760d8f9 [2023-02-15 01:41:09,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:41:09,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:41:09,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:41:09,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:41:09,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:41:09,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c653b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09, skipping insertion in model container [2023-02-15 01:41:09,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:41:09,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:41:09,660 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2023-02-15 01:41:09,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:41:09,668 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:41:09,703 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2023-02-15 01:41:09,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:41:09,731 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:41:09,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09 WrapperNode [2023-02-15 01:41:09,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:41:09,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:41:09,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:41:09,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:41:09,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,781 INFO L138 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2023-02-15 01:41:09,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:41:09,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:41:09,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:41:09,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:41:09,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,817 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:41:09,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:41:09,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:41:09,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:41:09,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (1/1) ... [2023-02-15 01:41:09,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:41:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:09,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:41:09,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:41:09,900 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 01:41:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 01:41:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:41:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:41:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:41:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:41:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:41:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:41:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:41:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:41:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:41:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:41:09,987 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:41:09,989 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:41:10,022 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 01:41:10,330 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:41:10,337 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:41:10,337 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2023-02-15 01:41:10,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:41:10 BoogieIcfgContainer [2023-02-15 01:41:10,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:41:10,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:41:10,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:41:10,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:41:10,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:41:09" (1/3) ... [2023-02-15 01:41:10,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd5d4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:41:10, skipping insertion in model container [2023-02-15 01:41:10,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:41:09" (2/3) ... [2023-02-15 01:41:10,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd5d4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:41:10, skipping insertion in model container [2023-02-15 01:41:10,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:41:10" (3/3) ... [2023-02-15 01:41:10,345 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2023-02-15 01:41:10,358 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:41:10,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-02-15 01:41:10,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:41:10,396 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;@7b7597aa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:41:10,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2023-02-15 01:41:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 01:41:10,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:10,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 01:41:10,406 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1083078, now seen corresponding path program 1 times [2023-02-15 01:41:10,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:10,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615346643] [2023-02-15 01:41:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:10,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:10,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:10,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615346643] [2023-02-15 01:41:10,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615346643] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:10,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:10,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:41:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299235998] [2023-02-15 01:41:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:10,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:41:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:41:10,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:41:10,598 INFO L87 Difference]: Start difference. First operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:10,615 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2023-02-15 01:41:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:41:10,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-02-15 01:41:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:10,623 INFO L225 Difference]: With dead ends: 117 [2023-02-15 01:41:10,623 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 01:41:10,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:41:10,626 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:10,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 01:41:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-15 01:41:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 110 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2023-02-15 01:41:10,653 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2023-02-15 01:41:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:10,653 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2023-02-15 01:41:10,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2023-02-15 01:41:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 01:41:10,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:10,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 01:41:10,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:41:10,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:10,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1079730, now seen corresponding path program 1 times [2023-02-15 01:41:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:10,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976141372] [2023-02-15 01:41:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:10,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:10,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976141372] [2023-02-15 01:41:10,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976141372] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:10,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:10,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:41:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425509824] [2023-02-15 01:41:10,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:10,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:41:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:41:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:10,713 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:10,784 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2023-02-15 01:41:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:41:10,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-02-15 01:41:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:10,786 INFO L225 Difference]: With dead ends: 136 [2023-02-15 01:41:10,787 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 01:41:10,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:10,789 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:10,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 01:41:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2023-02-15 01:41:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2023-02-15 01:41:10,806 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 4 [2023-02-15 01:41:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:10,806 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2023-02-15 01:41:10,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2023-02-15 01:41:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 01:41:10,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:10,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 01:41:10,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:41:10,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:10,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1079731, now seen corresponding path program 1 times [2023-02-15 01:41:10,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:10,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725563597] [2023-02-15 01:41:10,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:10,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:10,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 01:41:10,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:10,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725563597] [2023-02-15 01:41:10,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725563597] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:10,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:10,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:41:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198600930] [2023-02-15 01:41:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:10,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:41:10,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:10,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:41:10,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:10,873 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:10,910 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2023-02-15 01:41:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:41:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-02-15 01:41:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:10,911 INFO L225 Difference]: With dead ends: 157 [2023-02-15 01:41:10,911 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 01:41:10,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:10,913 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:10,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 01:41:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2023-02-15 01:41:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 109 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2023-02-15 01:41:10,919 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 4 [2023-02-15 01:41:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:10,919 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2023-02-15 01:41:10,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2023-02-15 01:41:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:41:10,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:10,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:10,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:41:10,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash -336207078, now seen corresponding path program 1 times [2023-02-15 01:41:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:10,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647836556] [2023-02-15 01:41:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:10,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:10,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647836556] [2023-02-15 01:41:10,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647836556] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:10,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179148025] [2023-02-15 01:41:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:10,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:10,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:10,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:41:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:11,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:41:11,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:11,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:11,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179148025] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:41:11,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:41:11,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 01:41:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723906100] [2023-02-15 01:41:11,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:41:11,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:41:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:41:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:41:11,116 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:11,190 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2023-02-15 01:41:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:41:11,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 01:41:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:11,194 INFO L225 Difference]: With dead ends: 244 [2023-02-15 01:41:11,194 INFO L226 Difference]: Without dead ends: 244 [2023-02-15 01:41:11,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:41:11,195 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 307 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:11,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 603 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-02-15 01:41:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 173. [2023-02-15 01:41:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.7518796992481203) internal successors, (233), 172 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 01:41:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2023-02-15 01:41:11,203 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 9 [2023-02-15 01:41:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:11,203 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2023-02-15 01:41:11,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2023-02-15 01:41:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:41:11,204 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:11,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:11,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:41:11,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:11,413 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash -991177183, now seen corresponding path program 1 times [2023-02-15 01:41:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:11,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679509905] [2023-02-15 01:41:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:11,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679509905] [2023-02-15 01:41:11,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679509905] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:11,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:11,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:41:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086801865] [2023-02-15 01:41:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:11,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:41:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:41:11,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:11,538 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:11,630 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2023-02-15 01:41:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:41:11,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-02-15 01:41:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:11,638 INFO L225 Difference]: With dead ends: 329 [2023-02-15 01:41:11,638 INFO L226 Difference]: Without dead ends: 329 [2023-02-15 01:41:11,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:11,641 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 111 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:11,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-02-15 01:41:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 172. [2023-02-15 01:41:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.7293233082706767) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2023-02-15 01:41:11,661 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 11 [2023-02-15 01:41:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:11,661 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2023-02-15 01:41:11,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2023-02-15 01:41:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:41:11,662 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:11,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:11,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:41:11,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash -991177182, now seen corresponding path program 1 times [2023-02-15 01:41:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:11,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492081825] [2023-02-15 01:41:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:11,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:11,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492081825] [2023-02-15 01:41:11,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492081825] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:11,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:11,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:41:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189822054] [2023-02-15 01:41:11,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:11,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:41:11,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:11,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:41:11,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:11,771 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:11,848 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2023-02-15 01:41:11,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:41:11,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-02-15 01:41:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:11,850 INFO L225 Difference]: With dead ends: 330 [2023-02-15 01:41:11,850 INFO L226 Difference]: Without dead ends: 330 [2023-02-15 01:41:11,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:11,853 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:11,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-02-15 01:41:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 171. [2023-02-15 01:41:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 170 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2023-02-15 01:41:11,862 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 11 [2023-02-15 01:41:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:11,862 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2023-02-15 01:41:11,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2023-02-15 01:41:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 01:41:11,863 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:11,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:11,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:41:11,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:11,865 INFO L85 PathProgramCache]: Analyzing trace with hash -661772220, now seen corresponding path program 1 times [2023-02-15 01:41:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:11,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89320409] [2023-02-15 01:41:11,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:11,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89320409] [2023-02-15 01:41:11,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89320409] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:11,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:11,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:41:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372274354] [2023-02-15 01:41:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:11,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:41:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:11,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:41:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:11,921 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:11,980 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2023-02-15 01:41:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:41:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-02-15 01:41:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:11,981 INFO L225 Difference]: With dead ends: 244 [2023-02-15 01:41:11,981 INFO L226 Difference]: Without dead ends: 244 [2023-02-15 01:41:11,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:11,982 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:11,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-02-15 01:41:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 169. [2023-02-15 01:41:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 168 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2023-02-15 01:41:11,989 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 12 [2023-02-15 01:41:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:11,989 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2023-02-15 01:41:11,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2023-02-15 01:41:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 01:41:11,990 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:11,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:11,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:41:11,991 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:11,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash -661772219, now seen corresponding path program 1 times [2023-02-15 01:41:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:11,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520198262] [2023-02-15 01:41:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:12,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520198262] [2023-02-15 01:41:12,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520198262] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:12,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:12,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:41:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109069575] [2023-02-15 01:41:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:12,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:41:12,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:41:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:41:12,084 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:12,152 INFO L93 Difference]: Finished difference Result 376 states and 459 transitions. [2023-02-15 01:41:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:41:12,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-02-15 01:41:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:12,154 INFO L225 Difference]: With dead ends: 376 [2023-02-15 01:41:12,154 INFO L226 Difference]: Without dead ends: 376 [2023-02-15 01:41:12,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:41:12,155 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 234 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:12,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 812 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:12,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-02-15 01:41:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 172. [2023-02-15 01:41:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 171 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2023-02-15 01:41:12,175 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 12 [2023-02-15 01:41:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:12,175 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2023-02-15 01:41:12,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2023-02-15 01:41:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:41:12,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:12,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:12,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 01:41:12,176 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash -51661170, now seen corresponding path program 1 times [2023-02-15 01:41:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:12,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738433592] [2023-02-15 01:41:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:12,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:12,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738433592] [2023-02-15 01:41:12,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738433592] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:12,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499671177] [2023-02-15 01:41:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:12,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:12,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:12,237 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:12,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:41:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:12,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 01:41:12,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:12,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:12,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499671177] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:41:12,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:41:12,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-02-15 01:41:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322664853] [2023-02-15 01:41:12,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:41:12,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:41:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:41:12,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:41:12,373 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:12,458 INFO L93 Difference]: Finished difference Result 391 states and 474 transitions. [2023-02-15 01:41:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:41:12,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 01:41:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:12,459 INFO L225 Difference]: With dead ends: 391 [2023-02-15 01:41:12,460 INFO L226 Difference]: Without dead ends: 391 [2023-02-15 01:41:12,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:41:12,460 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 485 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:12,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 814 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-02-15 01:41:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 196. [2023-02-15 01:41:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.55) internal successors, (248), 195 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2023-02-15 01:41:12,464 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 16 [2023-02-15 01:41:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:12,464 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2023-02-15 01:41:12,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2023-02-15 01:41:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 01:41:12,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:12,465 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2023-02-15 01:41:12,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:41:12,670 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,SelfDestructingSolverStorable8 [2023-02-15 01:41:12,671 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1254577850, now seen corresponding path program 2 times [2023-02-15 01:41:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:12,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988537575] [2023-02-15 01:41:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 01:41:12,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:12,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988537575] [2023-02-15 01:41:12,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988537575] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:12,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:12,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:41:12,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629521894] [2023-02-15 01:41:12,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:41:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:12,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:41:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:12,709 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:12,756 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2023-02-15 01:41:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:41:12,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 01:41:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:12,757 INFO L225 Difference]: With dead ends: 269 [2023-02-15 01:41:12,757 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 01:41:12,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:41:12,758 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 63 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:12,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 01:41:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2023-02-15 01:41:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 232 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 01:41:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2023-02-15 01:41:12,762 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 19 [2023-02-15 01:41:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:12,762 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2023-02-15 01:41:12,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2023-02-15 01:41:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 01:41:12,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:12,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:12,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 01:41:12,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1435011604, now seen corresponding path program 1 times [2023-02-15 01:41:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:12,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140806169] [2023-02-15 01:41:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 01:41:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:12,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140806169] [2023-02-15 01:41:12,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140806169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:12,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:12,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:41:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796391119] [2023-02-15 01:41:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:12,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:41:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:12,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:41:12,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:41:12,813 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:12,868 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2023-02-15 01:41:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:41:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 23 [2023-02-15 01:41:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:12,869 INFO L225 Difference]: With dead ends: 260 [2023-02-15 01:41:12,869 INFO L226 Difference]: Without dead ends: 260 [2023-02-15 01:41:12,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 01:41:12,870 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 105 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:12,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 380 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-15 01:41:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 217. [2023-02-15 01:41:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 216 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2023-02-15 01:41:12,873 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 23 [2023-02-15 01:41:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:12,873 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2023-02-15 01:41:12,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2023-02-15 01:41:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 01:41:12,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:12,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:12,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 01:41:12,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 877276576, now seen corresponding path program 2 times [2023-02-15 01:41:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:12,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188692443] [2023-02-15 01:41:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 01:41:13,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:13,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188692443] [2023-02-15 01:41:13,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188692443] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:13,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883179115] [2023-02-15 01:41:13,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:41:13,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:13,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:13,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:41:13,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:41:13,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:41:13,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:41:13,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:13,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:41:13,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:41:13,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:13,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:41:13,250 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:41:13,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:41:13,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:13,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:41:13,284 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:41:13,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:41:13,311 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:41:13,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 01:41:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:41:13,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:41:13,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883179115] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:41:13,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:41:13,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2023-02-15 01:41:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280568664] [2023-02-15 01:41:13,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:41:13,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 01:41:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 01:41:13,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:41:13,636 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:13,765 INFO L93 Difference]: Finished difference Result 272 states and 330 transitions. [2023-02-15 01:41:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:41:13,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 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 24 [2023-02-15 01:41:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:13,767 INFO L225 Difference]: With dead ends: 272 [2023-02-15 01:41:13,767 INFO L226 Difference]: Without dead ends: 272 [2023-02-15 01:41:13,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:41:13,768 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 479 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:13,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 262 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-02-15 01:41:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 215. [2023-02-15 01:41:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 181 states have (on average 1.4917127071823204) internal successors, (270), 214 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2023-02-15 01:41:13,772 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 24 [2023-02-15 01:41:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:13,772 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2023-02-15 01:41:13,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2023-02-15 01:41:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 01:41:13,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:13,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:13,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:41:13,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:13,981 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 361607171, now seen corresponding path program 1 times [2023-02-15 01:41:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:13,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242379309] [2023-02-15 01:41:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 01:41:14,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:14,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242379309] [2023-02-15 01:41:14,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242379309] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:14,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:14,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:41:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312135471] [2023-02-15 01:41:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:14,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:41:14,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:41:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:41:14,044 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:14,103 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2023-02-15 01:41:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:41:14,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 01:41:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:14,104 INFO L225 Difference]: With dead ends: 233 [2023-02-15 01:41:14,105 INFO L226 Difference]: Without dead ends: 233 [2023-02-15 01:41:14,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:41:14,105 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 15 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:14,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 407 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-15 01:41:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2023-02-15 01:41:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 216 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2023-02-15 01:41:14,108 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 25 [2023-02-15 01:41:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:14,109 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2023-02-15 01:41:14,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2023-02-15 01:41:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 01:41:14,109 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:14,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:14,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 01:41:14,110 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:14,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1675080075, now seen corresponding path program 1 times [2023-02-15 01:41:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:14,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219517403] [2023-02-15 01:41:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 01:41:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:14,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219517403] [2023-02-15 01:41:14,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219517403] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:14,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:14,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:41:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785797292] [2023-02-15 01:41:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:14,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:41:14,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:41:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:41:14,153 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:14,203 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2023-02-15 01:41:14,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:41:14,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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 26 [2023-02-15 01:41:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:14,204 INFO L225 Difference]: With dead ends: 219 [2023-02-15 01:41:14,204 INFO L226 Difference]: Without dead ends: 211 [2023-02-15 01:41:14,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:41:14,205 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:14,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-15 01:41:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2023-02-15 01:41:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.502857142857143) internal successors, (263), 208 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2023-02-15 01:41:14,208 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 26 [2023-02-15 01:41:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:14,208 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2023-02-15 01:41:14,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2023-02-15 01:41:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:41:14,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:14,209 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:14,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 01:41:14,209 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash -981051253, now seen corresponding path program 1 times [2023-02-15 01:41:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:14,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21158332] [2023-02-15 01:41:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 01:41:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:14,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21158332] [2023-02-15 01:41:14,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21158332] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:14,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:14,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:41:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832533416] [2023-02-15 01:41:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:14,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:41:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:14,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:41:14,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:41:14,265 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:14,335 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2023-02-15 01:41:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:41:14,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 29 [2023-02-15 01:41:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:14,338 INFO L225 Difference]: With dead ends: 235 [2023-02-15 01:41:14,338 INFO L226 Difference]: Without dead ends: 235 [2023-02-15 01:41:14,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:41:14,339 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 293 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:14,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 169 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-02-15 01:41:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 208. [2023-02-15 01:41:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 207 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 260 transitions. [2023-02-15 01:41:14,343 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 260 transitions. Word has length 29 [2023-02-15 01:41:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:14,343 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 260 transitions. [2023-02-15 01:41:14,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 260 transitions. [2023-02-15 01:41:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:41:14,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:14,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:14,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 01:41:14,345 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -981051252, now seen corresponding path program 1 times [2023-02-15 01:41:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:14,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660853660] [2023-02-15 01:41:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:14,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 01:41:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:14,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660853660] [2023-02-15 01:41:14,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660853660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:14,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:14,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:41:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029164185] [2023-02-15 01:41:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:14,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:41:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:14,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:41:14,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:41:14,451 INFO L87 Difference]: Start difference. First operand 208 states and 260 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:14,522 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2023-02-15 01:41:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:41:14,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 29 [2023-02-15 01:41:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:14,524 INFO L225 Difference]: With dead ends: 207 [2023-02-15 01:41:14,524 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 01:41:14,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:41:14,524 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 302 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:14,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 126 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 01:41:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2023-02-15 01:41:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 206 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2023-02-15 01:41:14,528 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 29 [2023-02-15 01:41:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:14,529 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2023-02-15 01:41:14,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2023-02-15 01:41:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:41:14,529 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:14,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:14,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:41:14,530 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash -347817722, now seen corresponding path program 1 times [2023-02-15 01:41:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:14,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921432395] [2023-02-15 01:41:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:14,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:41:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921432395] [2023-02-15 01:41:14,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921432395] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010900616] [2023-02-15 01:41:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:14,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:14,866 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:14,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:41:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:14,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 01:41:14,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:14,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:41:14,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:14,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:41:15,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:15,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:41:15,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:15,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:41:15,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:15,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:41:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 01:41:15,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 01:41:22,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010900616] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:41:22,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:41:22,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2023-02-15 01:41:22,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196422534] [2023-02-15 01:41:22,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:41:22,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:41:22,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:22,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:41:22,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:41:22,668 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:22,768 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2023-02-15 01:41:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:41:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 01:41:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:22,770 INFO L225 Difference]: With dead ends: 230 [2023-02-15 01:41:22,770 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 01:41:22,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:41:22,770 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 773 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:22,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 86 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 01:41:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2023-02-15 01:41:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 202 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2023-02-15 01:41:22,773 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 30 [2023-02-15 01:41:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:22,773 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2023-02-15 01:41:22,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2023-02-15 01:41:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:41:22,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:22,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:22,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:41:22,979 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,SelfDestructingSolverStorable16 [2023-02-15 01:41:22,980 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash -347817723, now seen corresponding path program 1 times [2023-02-15 01:41:22,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:22,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003621440] [2023-02-15 01:41:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:22,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:41:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:23,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003621440] [2023-02-15 01:41:23,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003621440] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:23,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919747886] [2023-02-15 01:41:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:23,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:23,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:23,214 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:23,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:41:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:23,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 01:41:23,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:23,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:41:23,349 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:41:23,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 01:41:23,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:23,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:41:23,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:23,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:41:23,412 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:41:23,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 01:41:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:41:23,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:41:23,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919747886] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:41:23,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:41:23,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2023-02-15 01:41:23,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473413301] [2023-02-15 01:41:23,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:41:23,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 01:41:23,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:23,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 01:41:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:41:23,742 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:23,849 INFO L93 Difference]: Finished difference Result 228 states and 272 transitions. [2023-02-15 01:41:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:41:23,849 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 01:41:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:23,850 INFO L225 Difference]: With dead ends: 228 [2023-02-15 01:41:23,850 INFO L226 Difference]: Without dead ends: 228 [2023-02-15 01:41:23,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-02-15 01:41:23,851 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 650 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:23,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 225 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-15 01:41:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 201. [2023-02-15 01:41:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.3885714285714286) internal successors, (243), 200 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 243 transitions. [2023-02-15 01:41:23,853 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 243 transitions. Word has length 30 [2023-02-15 01:41:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:23,854 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 243 transitions. [2023-02-15 01:41:23,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 243 transitions. [2023-02-15 01:41:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 01:41:23,854 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:23,854 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:23,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:41:24,080 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,SelfDestructingSolverStorable17 [2023-02-15 01:41:24,080 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:24,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1918350099, now seen corresponding path program 1 times [2023-02-15 01:41:24,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:24,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026162662] [2023-02-15 01:41:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:24,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 01:41:24,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:24,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026162662] [2023-02-15 01:41:24,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026162662] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:24,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145650706] [2023-02-15 01:41:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:24,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:24,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:24,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:24,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 01:41:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:24,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 01:41:24,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:24,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:24,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:24,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:24,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:24,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:24,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:24,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:24,926 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 19 treesize of output 18 [2023-02-15 01:41:25,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,047 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:41:25,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2023-02-15 01:41:25,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:25,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:25,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:25,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:25,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:25,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:25,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:25,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:41:25,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:41:25,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:41:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:25,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:25,216 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2023-02-15 01:41:25,243 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2023-02-15 01:41:25,257 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (forall ((v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2023-02-15 01:41:25,391 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2023-02-15 01:41:38,995 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|))))) is different from false [2023-02-15 01:41:39,074 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|))))) is different from false [2023-02-15 01:41:41,209 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|))))) is different from false [2023-02-15 01:41:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-02-15 01:41:41,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145650706] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:41:41,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:41:41,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 35 [2023-02-15 01:41:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797019119] [2023-02-15 01:41:41,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:41:41,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 01:41:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 01:41:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=581, Unknown=42, NotChecked=406, Total=1190 [2023-02-15 01:41:41,364 INFO L87 Difference]: Start difference. First operand 201 states and 243 transitions. Second operand has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:43,025 INFO L93 Difference]: Finished difference Result 365 states and 425 transitions. [2023-02-15 01:41:43,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 01:41:43,025 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 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 33 [2023-02-15 01:41:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:43,026 INFO L225 Difference]: With dead ends: 365 [2023-02-15 01:41:43,026 INFO L226 Difference]: Without dead ends: 365 [2023-02-15 01:41:43,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=454, Invalid=1092, Unknown=42, NotChecked=574, Total=2162 [2023-02-15 01:41:43,027 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 190 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 792 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:43,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1362 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 401 Invalid, 0 Unknown, 792 Unchecked, 0.5s Time] [2023-02-15 01:41:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-02-15 01:41:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 279. [2023-02-15 01:41:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 278 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 324 transitions. [2023-02-15 01:41:43,031 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 324 transitions. Word has length 33 [2023-02-15 01:41:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:43,031 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 324 transitions. [2023-02-15 01:41:43,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 324 transitions. [2023-02-15 01:41:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 01:41:43,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:43,031 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:43,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 01:41:43,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:43,232 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -919962184, now seen corresponding path program 1 times [2023-02-15 01:41:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:43,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858811793] [2023-02-15 01:41:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-15 01:41:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858811793] [2023-02-15 01:41:43,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858811793] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:43,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:43,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:41:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058971502] [2023-02-15 01:41:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:43,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:41:43,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:43,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:41:43,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:41:43,332 INFO L87 Difference]: Start difference. First operand 279 states and 324 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:43,380 INFO L93 Difference]: Finished difference Result 341 states and 386 transitions. [2023-02-15 01:41:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:41:43,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-02-15 01:41:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:43,381 INFO L225 Difference]: With dead ends: 341 [2023-02-15 01:41:43,382 INFO L226 Difference]: Without dead ends: 341 [2023-02-15 01:41:43,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:41:43,382 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 250 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:43,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 188 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:41:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-02-15 01:41:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 279. [2023-02-15 01:41:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 278 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 324 transitions. [2023-02-15 01:41:43,387 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 324 transitions. Word has length 55 [2023-02-15 01:41:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:43,387 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 324 transitions. [2023-02-15 01:41:43,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 324 transitions. [2023-02-15 01:41:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:41:43,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:43,388 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:43,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 01:41:43,399 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1545942185, now seen corresponding path program 1 times [2023-02-15 01:41:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:43,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852906583] [2023-02-15 01:41:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 01:41:43,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:43,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852906583] [2023-02-15 01:41:43,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852906583] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:43,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:43,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:41:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279402608] [2023-02-15 01:41:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:43,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:41:43,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:41:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:41:43,710 INFO L87 Difference]: Start difference. First operand 279 states and 324 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:43,967 INFO L93 Difference]: Finished difference Result 470 states and 540 transitions. [2023-02-15 01:41:43,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:41:43,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 56 [2023-02-15 01:41:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:43,971 INFO L225 Difference]: With dead ends: 470 [2023-02-15 01:41:43,971 INFO L226 Difference]: Without dead ends: 470 [2023-02-15 01:41:43,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:41:43,973 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 802 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:43,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 421 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:41:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-02-15 01:41:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 305. [2023-02-15 01:41:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 280 states have (on average 1.2857142857142858) internal successors, (360), 304 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 360 transitions. [2023-02-15 01:41:43,979 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 360 transitions. Word has length 56 [2023-02-15 01:41:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:43,979 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 360 transitions. [2023-02-15 01:41:43,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 360 transitions. [2023-02-15 01:41:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:41:43,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:43,980 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:43,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 01:41:43,980 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1545942186, now seen corresponding path program 1 times [2023-02-15 01:41:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:43,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587551428] [2023-02-15 01:41:43,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:44,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587551428] [2023-02-15 01:41:44,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587551428] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:44,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341891681] [2023-02-15 01:41:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:44,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:44,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:44,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:44,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 01:41:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:44,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 01:41:44,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:44,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:41:44,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341891681] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:41:44,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:41:44,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2023-02-15 01:41:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509527947] [2023-02-15 01:41:44,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:41:44,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 01:41:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 01:41:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:41:44,430 INFO L87 Difference]: Start difference. First operand 305 states and 360 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:44,676 INFO L93 Difference]: Finished difference Result 688 states and 794 transitions. [2023-02-15 01:41:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:41:44,677 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 56 [2023-02-15 01:41:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:44,679 INFO L225 Difference]: With dead ends: 688 [2023-02-15 01:41:44,679 INFO L226 Difference]: Without dead ends: 688 [2023-02-15 01:41:44,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=260, Invalid=552, Unknown=0, NotChecked=0, Total=812 [2023-02-15 01:41:44,680 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 710 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:44,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1996 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-02-15 01:41:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 347. [2023-02-15 01:41:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 322 states have (on average 1.2857142857142858) internal successors, (414), 346 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 414 transitions. [2023-02-15 01:41:44,686 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 414 transitions. Word has length 56 [2023-02-15 01:41:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:44,687 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 414 transitions. [2023-02-15 01:41:44,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 414 transitions. [2023-02-15 01:41:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:41:44,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:44,688 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:44,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:41:44,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:44,894 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:44,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -276278870, now seen corresponding path program 2 times [2023-02-15 01:41:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:44,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674510903] [2023-02-15 01:41:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 01:41:45,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:45,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674510903] [2023-02-15 01:41:45,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674510903] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:45,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:45,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:41:45,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346383598] [2023-02-15 01:41:45,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:45,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:41:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:45,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:41:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:41:45,212 INFO L87 Difference]: Start difference. First operand 347 states and 414 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 01:41:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:45,447 INFO L93 Difference]: Finished difference Result 511 states and 616 transitions. [2023-02-15 01:41:45,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:41:45,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 56 [2023-02-15 01:41:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:45,450 INFO L225 Difference]: With dead ends: 511 [2023-02-15 01:41:45,450 INFO L226 Difference]: Without dead ends: 511 [2023-02-15 01:41:45,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:41:45,450 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 824 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:45,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 355 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-02-15 01:41:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 380. [2023-02-15 01:41:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 355 states have (on average 1.3070422535211268) internal successors, (464), 379 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 464 transitions. [2023-02-15 01:41:45,456 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 464 transitions. Word has length 56 [2023-02-15 01:41:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:45,456 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 464 transitions. [2023-02-15 01:41:45,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 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 01:41:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 464 transitions. [2023-02-15 01:41:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 01:41:45,457 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:45,457 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 01:41:45,457 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 25284007, now seen corresponding path program 1 times [2023-02-15 01:41:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988751571] [2023-02-15 01:41:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-15 01:41:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:45,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988751571] [2023-02-15 01:41:45,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988751571] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:45,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:45,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:41:45,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191455422] [2023-02-15 01:41:45,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:45,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:41:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:45,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:41:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:41:45,583 INFO L87 Difference]: Start difference. First operand 380 states and 464 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:45,705 INFO L93 Difference]: Finished difference Result 430 states and 532 transitions. [2023-02-15 01:41:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:41:45,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 57 [2023-02-15 01:41:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:45,707 INFO L225 Difference]: With dead ends: 430 [2023-02-15 01:41:45,707 INFO L226 Difference]: Without dead ends: 430 [2023-02-15 01:41:45,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:41:45,707 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 53 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:45,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 507 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-02-15 01:41:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 418. [2023-02-15 01:41:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 393 states have (on average 1.3333333333333333) internal successors, (524), 417 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 524 transitions. [2023-02-15 01:41:45,712 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 524 transitions. Word has length 57 [2023-02-15 01:41:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:45,714 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 524 transitions. [2023-02-15 01:41:45,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 524 transitions. [2023-02-15 01:41:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 01:41:45,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:45,715 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:45,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 01:41:45,715 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 783803729, now seen corresponding path program 1 times [2023-02-15 01:41:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:45,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420090193] [2023-02-15 01:41:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 01:41:45,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:45,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420090193] [2023-02-15 01:41:45,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420090193] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:41:45,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:41:45,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:41:45,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078856270] [2023-02-15 01:41:45,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:41:45,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:41:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:45,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:41:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:41:45,891 INFO L87 Difference]: Start difference. First operand 418 states and 524 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 01:41:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:46,023 INFO L93 Difference]: Finished difference Result 516 states and 637 transitions. [2023-02-15 01:41:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:41:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 58 [2023-02-15 01:41:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:46,025 INFO L225 Difference]: With dead ends: 516 [2023-02-15 01:41:46,025 INFO L226 Difference]: Without dead ends: 516 [2023-02-15 01:41:46,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-02-15 01:41:46,026 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 659 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:46,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 415 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:41:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2023-02-15 01:41:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 418. [2023-02-15 01:41:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 393 states have (on average 1.3206106870229009) internal successors, (519), 417 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:41:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 519 transitions. [2023-02-15 01:41:46,031 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 519 transitions. Word has length 58 [2023-02-15 01:41:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:46,031 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 519 transitions. [2023-02-15 01:41:46,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 01:41:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 519 transitions. [2023-02-15 01:41:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:41:46,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:46,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:46,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 01:41:46,032 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-02-15 01:41:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1466385390, now seen corresponding path program 1 times [2023-02-15 01:41:46,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:46,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152473329] [2023-02-15 01:41:46,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 01:41:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:46,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152473329] [2023-02-15 01:41:46,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152473329] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:46,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611110195] [2023-02-15 01:41:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:46,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:46,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:46,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:46,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 01:41:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:46,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 01:41:46,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:46,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:41:46,874 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:41:46,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:41:46,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:41:47,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:41:47,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:47,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 01:41:47,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:41:47,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:41:47,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 01:41:47,366 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 23 treesize of output 22 [2023-02-15 01:41:47,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:41:47,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:47,689 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2023-02-15 01:41:47,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 42 [2023-02-15 01:41:47,695 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:41:47,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2023-02-15 01:41:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 01:41:47,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:48,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:41:48,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1424 treesize of output 1405