./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers2.c -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 cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 02:27:01,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:27:01,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:27:01,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:27:01,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:27:01,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:27:01,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:27:01,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:27:01,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:27:01,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:27:01,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:27:01,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:27:01,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:27:01,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:27:01,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:27:01,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:27:01,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:27:01,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:27:01,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:27:01,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:27:01,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:27:01,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:27:01,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:27:01,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:27:01,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:27:01,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:27:01,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:27:01,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:27:01,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:27:01,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:27:01,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:27:01,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:27:01,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:27:01,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:27:01,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:27:01,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:27:01,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:27:01,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:27:01,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:27:01,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:27:01,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:27:01,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 02:27:01,157 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:27:01,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:27:01,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:27:01,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:27:01,158 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:27:01,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:27:01,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:27:01,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:27:01,159 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:27:01,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:27:01,160 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 02:27:01,160 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:27:01,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:27:01,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 02:27:01,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:27:01,161 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 02:27:01,161 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 02:27:01,161 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 02:27:01,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:27:01,161 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 02:27:01,162 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 02:27:01,162 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:27:01,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:27:01,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:27:01,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:27:01,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:27:01,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:27:01,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:27:01,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 02:27:01,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 02:27:01,163 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:27:01,163 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:27:01,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:27:01,164 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:27:01,164 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 -> cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd [2023-02-14 02:27:01,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:27:01,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:27:01,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:27:01,394 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:27:01,394 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:27:01,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2023-02-14 02:27:02,371 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:27:02,502 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:27:02,503 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2023-02-14 02:27:02,507 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d3957bd/cf88e19437234c45918349e228f13120/FLAG0ddc63692 [2023-02-14 02:27:02,521 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d3957bd/cf88e19437234c45918349e228f13120 [2023-02-14 02:27:02,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:27:02,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:27:02,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:27:02,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:27:02,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:27:02,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fee71a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02, skipping insertion in model container [2023-02-14 02:27:02,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:27:02,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:27:02,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:27:02,676 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:27:02,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:27:02,698 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:27:02,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02 WrapperNode [2023-02-14 02:27:02,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:27:02,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:27:02,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:27:02,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:27:02,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,724 INFO L138 Inliner]: procedures = 10, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2023-02-14 02:27:02,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:27:02,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:27:02,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:27:02,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:27:02,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,745 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:27:02,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:27:02,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:27:02,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:27:02,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (1/1) ... [2023-02-14 02:27:02,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:27:02,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:27:02,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 02:27:02,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 02:27:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 02:27:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 02:27:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:27:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:27:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 02:27:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 02:27:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 02:27:02,872 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:27:02,874 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:27:03,089 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:27:03,093 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:27:03,100 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 02:27:03,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:27:03 BoogieIcfgContainer [2023-02-14 02:27:03,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:27:03,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:27:03,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:27:03,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:27:03,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:27:02" (1/3) ... [2023-02-14 02:27:03,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b355e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:27:03, skipping insertion in model container [2023-02-14 02:27:03,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:27:02" (2/3) ... [2023-02-14 02:27:03,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b355e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:27:03, skipping insertion in model container [2023-02-14 02:27:03,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:27:03" (3/3) ... [2023-02-14 02:27:03,121 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2.c [2023-02-14 02:27:03,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:27:03,135 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-02-14 02:27:03,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:27:03,172 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;@573e388a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:27:03,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-02-14 02:27:03,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 02:27:03,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:03,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 02:27:03,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:03,183 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-02-14 02:27:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:03,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12570317] [2023-02-14 02:27:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:27:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:03,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12570317] [2023-02-14 02:27:03,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12570317] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:27:03,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:27:03,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-14 02:27:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142049929] [2023-02-14 02:27:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:27:03,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:27:03,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:27:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:27:03,373 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 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-14 02:27:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:03,413 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-02-14 02:27:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:27:03,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-14 02:27:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:03,420 INFO L225 Difference]: With dead ends: 27 [2023-02-14 02:27:03,421 INFO L226 Difference]: Without dead ends: 25 [2023-02-14 02:27:03,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:27:03,426 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:03,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-14 02:27:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-14 02:27:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-02-14 02:27:03,449 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 4 [2023-02-14 02:27:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:03,449 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-02-14 02:27:03,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-14 02:27:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-02-14 02:27:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 02:27:03,450 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:03,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 02:27:03,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 02:27:03,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2023-02-14 02:27:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:03,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865820058] [2023-02-14 02:27:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:03,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:27:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:03,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865820058] [2023-02-14 02:27:03,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865820058] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:27:03,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:27:03,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:27:03,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391309747] [2023-02-14 02:27:03,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:27:03,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:27:03,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:03,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:27:03,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:27:03,572 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 4 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-14 02:27:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:03,606 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-02-14 02:27:03,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 02:27:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-14 02:27:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:03,608 INFO L225 Difference]: With dead ends: 28 [2023-02-14 02:27:03,608 INFO L226 Difference]: Without dead ends: 28 [2023-02-14 02:27:03,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:27:03,611 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:03,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-14 02:27:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-02-14 02:27:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-02-14 02:27:03,618 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 4 [2023-02-14 02:27:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:03,618 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-02-14 02:27:03,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-14 02:27:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-02-14 02:27:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 02:27:03,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:03,619 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-02-14 02:27:03,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 02:27:03,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2023-02-14 02:27:03,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:03,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256163324] [2023-02-14 02:27:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:27:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256163324] [2023-02-14 02:27:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256163324] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:27:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943856331] [2023-02-14 02:27:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:27:03,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:27:03,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 02:27:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:03,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 02:27:03,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:27:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:27:03,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:27:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:27:04,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943856331] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:27:04,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:27:04,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-02-14 02:27:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581298020] [2023-02-14 02:27:04,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:27:04,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 02:27:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 02:27:04,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-02-14 02:27:04,034 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:04,204 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-02-14 02:27:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:27:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 7 [2023-02-14 02:27:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:04,206 INFO L225 Difference]: With dead ends: 34 [2023-02-14 02:27:04,206 INFO L226 Difference]: Without dead ends: 34 [2023-02-14 02:27:04,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2023-02-14 02:27:04,209 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:04,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 35 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-14 02:27:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-14 02:27:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-02-14 02:27:04,217 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2023-02-14 02:27:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:04,217 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-02-14 02:27:04,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-02-14 02:27:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 02:27:04,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:04,219 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:04,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 02:27:04,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:04,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2023-02-14 02:27:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:04,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686243025] [2023-02-14 02:27:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:27:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686243025] [2023-02-14 02:27:04,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686243025] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:27:04,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944695988] [2023-02-14 02:27:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:04,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:04,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:27:04,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:27:04,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 02:27:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:04,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 02:27:04,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:27:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:27:04,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:27:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:27:04,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944695988] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:27:04,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:27:04,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-14 02:27:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550607199] [2023-02-14 02:27:04,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:27:04,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 02:27:04,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 02:27:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-14 02:27:04,738 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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-14 02:27:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:04,773 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2023-02-14 02:27:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 02:27:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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 19 [2023-02-14 02:27:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:04,775 INFO L225 Difference]: With dead ends: 52 [2023-02-14 02:27:04,775 INFO L226 Difference]: Without dead ends: 52 [2023-02-14 02:27:04,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-14 02:27:04,777 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:04,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-14 02:27:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-14 02:27:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-02-14 02:27:04,788 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 19 [2023-02-14 02:27:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:04,789 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-02-14 02:27:04,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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-14 02:27:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2023-02-14 02:27:04,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 02:27:04,790 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:04,790 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:04,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 02:27:04,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-14 02:27:04,995 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2023-02-14 02:27:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:04,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504338880] [2023-02-14 02:27:04,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:05,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504338880] [2023-02-14 02:27:05,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504338880] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:27:05,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:27:05,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:27:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3697014] [2023-02-14 02:27:05,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:27:05,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:27:05,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:05,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:27:05,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:27:05,232 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:05,279 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2023-02-14 02:27:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:27:05,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-14 02:27:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:05,280 INFO L225 Difference]: With dead ends: 60 [2023-02-14 02:27:05,280 INFO L226 Difference]: Without dead ends: 60 [2023-02-14 02:27:05,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:27:05,281 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 57 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:05,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 26 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-14 02:27:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2023-02-14 02:27:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2023-02-14 02:27:05,284 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 37 [2023-02-14 02:27:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:05,284 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2023-02-14 02:27:05,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2023-02-14 02:27:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 02:27:05,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:05,285 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:05,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 02:27:05,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2023-02-14 02:27:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:05,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609302566] [2023-02-14 02:27:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:05,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:05,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609302566] [2023-02-14 02:27:05,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609302566] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:27:05,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:27:05,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:27:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455136569] [2023-02-14 02:27:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:27:05,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:27:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:05,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:27:05,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:27:05,385 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:05,412 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2023-02-14 02:27:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:27:05,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-14 02:27:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:05,413 INFO L225 Difference]: With dead ends: 53 [2023-02-14 02:27:05,413 INFO L226 Difference]: Without dead ends: 53 [2023-02-14 02:27:05,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:27:05,413 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:05,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 30 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-14 02:27:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-14 02:27:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2023-02-14 02:27:05,416 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2023-02-14 02:27:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:05,416 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2023-02-14 02:27:05,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2023-02-14 02:27:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 02:27:05,417 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:05,417 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:05,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 02:27:05,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:05,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:05,417 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2023-02-14 02:27:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:05,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131872953] [2023-02-14 02:27:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:05,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:05,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:05,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131872953] [2023-02-14 02:27:05,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131872953] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:27:05,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:27:05,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:27:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250704785] [2023-02-14 02:27:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:27:05,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:27:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:27:05,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:27:05,499 INFO L87 Difference]: Start difference. First operand 53 states and 54 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-14 02:27:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:05,507 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2023-02-14 02:27:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:27:05,508 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 38 [2023-02-14 02:27:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:05,508 INFO L225 Difference]: With dead ends: 52 [2023-02-14 02:27:05,509 INFO L226 Difference]: Without dead ends: 52 [2023-02-14 02:27:05,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:27:05,509 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:05,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-14 02:27:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-14 02:27:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-02-14 02:27:05,512 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 38 [2023-02-14 02:27:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:05,512 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-02-14 02:27:05,512 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-14 02:27:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2023-02-14 02:27:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 02:27:05,513 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:05,513 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:05,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 02:27:05,513 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:05,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2023-02-14 02:27:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:05,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599421438] [2023-02-14 02:27:05,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:05,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:05,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599421438] [2023-02-14 02:27:05,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599421438] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:27:05,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:27:05,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:27:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437181353] [2023-02-14 02:27:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:27:05,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:27:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:27:05,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:27:05,589 INFO L87 Difference]: Start difference. First operand 52 states and 53 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-14 02:27:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:05,603 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2023-02-14 02:27:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:27:05,603 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 38 [2023-02-14 02:27:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:05,604 INFO L225 Difference]: With dead ends: 55 [2023-02-14 02:27:05,604 INFO L226 Difference]: Without dead ends: 55 [2023-02-14 02:27:05,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:27:05,605 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 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-14 02:27:05,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-14 02:27:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-14 02:27:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2023-02-14 02:27:05,607 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 38 [2023-02-14 02:27:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:05,607 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2023-02-14 02:27:05,608 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-14 02:27:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2023-02-14 02:27:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 02:27:05,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:05,608 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:05,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 02:27:05,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:05,609 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2023-02-14 02:27:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:05,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598366443] [2023-02-14 02:27:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:05,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598366443] [2023-02-14 02:27:05,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598366443] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:27:05,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016214117] [2023-02-14 02:27:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:05,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:05,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:27:05,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:27:05,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 02:27:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:05,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 02:27:05,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:27:06,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:27:06,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:27:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:06,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:27:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:08,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016214117] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:27:08,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:27:08,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-02-14 02:27:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135363225] [2023-02-14 02:27:08,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:27:08,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 02:27:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 02:27:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-14 02:27:08,693 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:08,871 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2023-02-14 02:27:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:27:08,872 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-14 02:27:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:08,873 INFO L225 Difference]: With dead ends: 85 [2023-02-14 02:27:08,873 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 02:27:08,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-02-14 02:27:08,873 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 142 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:08,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 65 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:27:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 02:27:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2023-02-14 02:27:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2023-02-14 02:27:08,876 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 42 [2023-02-14 02:27:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:08,876 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2023-02-14 02:27:08,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2023-02-14 02:27:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:27:08,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:08,877 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:08,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 02:27:09,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:09,082 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2023-02-14 02:27:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:09,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6696695] [2023-02-14 02:27:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-02-14 02:27:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:09,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6696695] [2023-02-14 02:27:09,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6696695] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:27:09,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783614702] [2023-02-14 02:27:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:09,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:27:09,227 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:27:09,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 02:27:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:09,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 02:27:09,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:27:09,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:27:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:09,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:27:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:09,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783614702] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:27:09,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:27:09,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2023-02-14 02:27:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278131397] [2023-02-14 02:27:09,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:27:09,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 02:27:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 02:27:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 02:27:09,400 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:09,540 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2023-02-14 02:27:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 02:27:09,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 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 43 [2023-02-14 02:27:09,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:09,541 INFO L225 Difference]: With dead ends: 66 [2023-02-14 02:27:09,541 INFO L226 Difference]: Without dead ends: 66 [2023-02-14 02:27:09,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-14 02:27:09,542 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 101 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:09,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 42 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-14 02:27:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-14 02:27:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 65 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2023-02-14 02:27:09,546 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 43 [2023-02-14 02:27:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:09,547 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2023-02-14 02:27:09,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2023-02-14 02:27:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-14 02:27:09,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:09,548 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:09,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-14 02:27:09,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:09,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2023-02-14 02:27:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:09,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079780449] [2023-02-14 02:27:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:10,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:10,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079780449] [2023-02-14 02:27:10,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079780449] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:27:10,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245124311] [2023-02-14 02:27:10,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 02:27:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:27:10,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:27:10,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 02:27:10,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 02:27:10,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 02:27:10,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 02:27:10,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:27:10,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:27:10,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:27:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:10,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:27:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:13,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245124311] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:27:13,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:27:13,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2023-02-14 02:27:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511956310] [2023-02-14 02:27:13,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:27:13,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-14 02:27:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 02:27:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2023-02-14 02:27:13,004 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:13,529 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2023-02-14 02:27:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 02:27:13,529 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 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-14 02:27:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:13,530 INFO L225 Difference]: With dead ends: 136 [2023-02-14 02:27:13,530 INFO L226 Difference]: Without dead ends: 136 [2023-02-14 02:27:13,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2023-02-14 02:27:13,531 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 652 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:13,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 155 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:27:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-14 02:27:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2023-02-14 02:27:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.108695652173913) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-02-14 02:27:13,534 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 57 [2023-02-14 02:27:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:13,534 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-02-14 02:27:13,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-02-14 02:27:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-14 02:27:13,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:13,545 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:13,550 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-14 02:27:13,750 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,SelfDestructingSolverStorable10 [2023-02-14 02:27:13,750 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash 893071724, now seen corresponding path program 1 times [2023-02-14 02:27:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:13,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251672367] [2023-02-14 02:27:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:13,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:13,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251672367] [2023-02-14 02:27:13,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251672367] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:27:13,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284461992] [2023-02-14 02:27:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:13,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:27:13,828 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:27:13,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 02:27:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:13,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 02:27:13,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:27:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:13,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:27:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:13,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284461992] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:27:13,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:27:13,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2023-02-14 02:27:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267125047] [2023-02-14 02:27:13,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:27:13,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 02:27:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 02:27:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-14 02:27:13,976 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:14,017 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2023-02-14 02:27:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 02:27:14,018 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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 64 [2023-02-14 02:27:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:14,018 INFO L225 Difference]: With dead ends: 96 [2023-02-14 02:27:14,018 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 02:27:14,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-14 02:27:14,019 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:14,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 02:27:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-02-14 02:27:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 95 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2023-02-14 02:27:14,032 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 64 [2023-02-14 02:27:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:14,032 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2023-02-14 02:27:14,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2023-02-14 02:27:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-14 02:27:14,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:14,035 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:14,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 02:27:14,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:14,240 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash -713446614, now seen corresponding path program 3 times [2023-02-14 02:27:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:14,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093934718] [2023-02-14 02:27:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:27:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 199 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-02-14 02:27:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:27:14,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093934718] [2023-02-14 02:27:14,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093934718] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:27:14,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817131549] [2023-02-14 02:27:14,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 02:27:14,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:14,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:27:14,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:27:14,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 02:27:14,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-14 02:27:14,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 02:27:14,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 02:27:14,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:27:14,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:27:14,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:27:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2023-02-14 02:27:14,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:27:14,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817131549] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:27:14,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:27:14,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2023-02-14 02:27:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33038656] [2023-02-14 02:27:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:27:14,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 02:27:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:27:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 02:27:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2023-02-14 02:27:14,906 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:27:14,991 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2023-02-14 02:27:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:27:14,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-14 02:27:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:27:14,992 INFO L225 Difference]: With dead ends: 95 [2023-02-14 02:27:14,992 INFO L226 Difference]: Without dead ends: 95 [2023-02-14 02:27:14,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2023-02-14 02:27:14,992 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:27:14,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:27:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-14 02:27:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-02-14 02:27:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2023-02-14 02:27:14,994 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 87 [2023-02-14 02:27:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:27:14,994 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2023-02-14 02:27:14,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:27:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2023-02-14 02:27:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-14 02:27:14,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:27:14,995 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:14,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 02:27:15,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:27:15,195 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-14 02:27:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:27:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1572522744, now seen corresponding path program 2 times [2023-02-14 02:27:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:27:15,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432087343] [2023-02-14 02:27:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:27:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:27:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 02:27:15,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 02:27:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 02:27:15,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 02:27:15,277 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 02:27:15,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2023-02-14 02:27:15,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2023-02-14 02:27:15,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-02-14 02:27:15,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-02-14 02:27:15,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-02-14 02:27:15,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-02-14 02:27:15,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2023-02-14 02:27:15,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2023-02-14 02:27:15,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2023-02-14 02:27:15,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 02:27:15,282 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:27:15,284 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 02:27:15,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 02:27:15 BoogieIcfgContainer [2023-02-14 02:27:15,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 02:27:15,325 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 02:27:15,325 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 02:27:15,325 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 02:27:15,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:27:03" (3/4) ... [2023-02-14 02:27:15,326 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 02:27:15,361 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 02:27:15,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 02:27:15,361 INFO L158 Benchmark]: Toolchain (without parser) took 12837.87ms. Allocated memory was 140.5MB in the beginning and 218.1MB in the end (delta: 77.6MB). Free memory was 96.0MB in the beginning and 182.4MB in the end (delta: -86.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:27:15,361 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 44.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:27:15,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.41ms. Allocated memory is still 140.5MB. Free memory was 95.7MB in the beginning and 85.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 02:27:15,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.94ms. Allocated memory is still 140.5MB. Free memory was 85.9MB in the beginning and 84.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 02:27:15,362 INFO L158 Benchmark]: Boogie Preprocessor took 21.87ms. Allocated memory is still 140.5MB. Free memory was 84.4MB in the beginning and 83.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 02:27:15,362 INFO L158 Benchmark]: RCFGBuilder took 354.79ms. Allocated memory is still 140.5MB. Free memory was 83.1MB in the beginning and 112.2MB in the end (delta: -29.2MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-02-14 02:27:15,362 INFO L158 Benchmark]: TraceAbstraction took 12220.80ms. Allocated memory was 140.5MB in the beginning and 218.1MB in the end (delta: 77.6MB). Free memory was 111.5MB in the beginning and 186.6MB in the end (delta: -75.1MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2023-02-14 02:27:15,363 INFO L158 Benchmark]: Witness Printer took 36.15ms. Allocated memory is still 218.1MB. Free memory was 186.6MB in the beginning and 182.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-14 02:27:15,364 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 44.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.41ms. Allocated memory is still 140.5MB. Free memory was 95.7MB in the beginning and 85.9MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.94ms. Allocated memory is still 140.5MB. Free memory was 85.9MB in the beginning and 84.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.87ms. Allocated memory is still 140.5MB. Free memory was 84.4MB in the beginning and 83.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.79ms. Allocated memory is still 140.5MB. Free memory was 83.1MB in the beginning and 112.2MB in the end (delta: -29.2MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12220.80ms. Allocated memory was 140.5MB in the beginning and 218.1MB in the end (delta: 77.6MB). Free memory was 111.5MB in the beginning and 186.6MB in the end (delta: -75.1MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. * Witness Printer took 36.15ms. Allocated memory is still 218.1MB. Free memory was 186.6MB in the beginning and 182.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; VAL [array={1:0}] [L25] CALL, EXPR getNumbers2() [L13] CALL, EXPR getNumbers() [L5] int i = 0; VAL [array={1:0}, i=0] [L5] COND TRUE i < 10 VAL [array={1:0}, i=0] [L6] array[i] = i VAL [array={1:0}, i=0] [L5] ++i VAL [array={1:0}, i=1] [L5] COND TRUE i < 10 VAL [array={1:0}, i=1] [L6] array[i] = i VAL [array={1:0}, i=1] [L5] ++i VAL [array={1:0}, i=2] [L5] COND TRUE i < 10 VAL [array={1:0}, i=2] [L6] array[i] = i VAL [array={1:0}, i=2] [L5] ++i VAL [array={1:0}, i=3] [L5] COND TRUE i < 10 VAL [array={1:0}, i=3] [L6] array[i] = i VAL [array={1:0}, i=3] [L5] ++i VAL [array={1:0}, i=4] [L5] COND TRUE i < 10 VAL [array={1:0}, i=4] [L6] array[i] = i VAL [array={1:0}, i=4] [L5] ++i VAL [array={1:0}, i=5] [L5] COND TRUE i < 10 VAL [array={1:0}, i=5] [L6] array[i] = i VAL [array={1:0}, i=5] [L5] ++i VAL [array={1:0}, i=6] [L5] COND TRUE i < 10 VAL [array={1:0}, i=6] [L6] array[i] = i VAL [array={1:0}, i=6] [L5] ++i VAL [array={1:0}, i=7] [L5] COND TRUE i < 10 VAL [array={1:0}, i=7] [L6] array[i] = i VAL [array={1:0}, i=7] [L5] ++i VAL [array={1:0}, i=8] [L5] COND TRUE i < 10 VAL [array={1:0}, i=8] [L6] array[i] = i VAL [array={1:0}, i=8] [L5] ++i VAL [array={1:0}, i=9] [L5] COND TRUE i < 10 VAL [array={1:0}, i=9] [L6] array[i] = i VAL [array={1:0}, i=9] [L5] ++i VAL [array={1:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={1:0}, i=10] [L9] return array; VAL [\result={1:0}, array={1:0}, i=10] [L13] RET, EXPR getNumbers() [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}, numbers[i]=0] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=0, numbers={1:0}, numbers2={10:0}, numbers[i]=0] [L17] ++i VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}, numbers[i]=1] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=1, numbers={1:0}, numbers2={10:0}, numbers[i]=1] [L17] ++i VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}, numbers[i]=2] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=2, numbers={1:0}, numbers2={10:0}, numbers[i]=2] [L17] ++i VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}, numbers[i]=3] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=3, numbers={1:0}, numbers2={10:0}, numbers[i]=3] [L17] ++i VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}, numbers[i]=4] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=4, numbers={1:0}, numbers2={10:0}, numbers[i]=4] [L17] ++i VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}, numbers[i]=5] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=5, numbers={1:0}, numbers2={10:0}, numbers[i]=5] [L17] ++i VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}, numbers[i]=6] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=6, numbers={1:0}, numbers2={10:0}, numbers[i]=6] [L17] ++i VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}, numbers[i]=7] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=7, numbers={1:0}, numbers2={10:0}, numbers[i]=7] [L17] ++i VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}, numbers[i]=8] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=8, numbers={1:0}, numbers2={10:0}, numbers[i]=8] [L17] ++i VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}] [L18] EXPR numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}, numbers[i]=9] [L18] numbers2[i] = numbers[i] VAL [array={1:0}, i=9, numbers={1:0}, numbers2={10:0}, numbers[i]=9] [L17] ++i VAL [array={1:0}, i=10, numbers={1:0}, numbers2={10:0}] [L17] COND FALSE !(i < 10) VAL [array={1:0}, i=10, numbers={1:0}, numbers2={10:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={10:0}, array={1:0}, i=10, numbers={1:0}] [L25] RET, EXPR getNumbers2() [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1165 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1165 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 406 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 747 IncrementalHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 204 mSDtfsCounter, 747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 498 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=11, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 68 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 885 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1002 ConstructedInterpolants, 68 QuantifiedInterpolants, 8753 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1045 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 3056/3466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-14 02:27:15,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)