/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/loops-crafted-1/discover_list.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:02:47,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:02:47,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:02:47,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:02:47,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:02:47,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:02:47,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:02:47,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:02:47,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:02:47,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:02:47,201 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:02:47,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:02:47,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:02:47,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:02:47,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:02:47,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:02:47,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:02:47,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:02:47,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:02:47,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:02:47,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:02:47,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:02:47,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:02:47,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:02:47,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:02:47,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:02:47,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:02:47,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:02:47,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:02:47,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:02:47,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:02:47,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:02:47,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:02:47,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:02:47,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:02:47,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:02:47,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:02:47,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:02:47,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:02:47,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:02:47,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:02:47,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:02:47,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:02:47,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:02:47,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:02:47,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:02:47,326 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:02:47,326 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:02:47,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:02:47,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:02:47,330 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:02:47,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:02:47,331 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:02:47,332 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:02:47,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:02:47,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:02:47,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:02:47,333 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:02:47,333 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:02:47,333 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:02:47,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:02:47,333 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:02:47,334 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:02:47,334 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:02:47,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:02:47,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:02:47,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:02:47,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:02:47,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:02:47,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:02:47,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:02:47,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:02:47,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-15 17:02:47,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:02:47,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:02:47,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:02:47,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:02:47,914 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:02:47,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2022-10-15 17:02:48,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6168daa44/7aa8c8b898214d0eabc9433d3f05e5c8/FLAG2d22cb9be [2022-10-15 17:02:48,965 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:02:48,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2022-10-15 17:02:48,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6168daa44/7aa8c8b898214d0eabc9433d3f05e5c8/FLAG2d22cb9be [2022-10-15 17:02:49,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6168daa44/7aa8c8b898214d0eabc9433d3f05e5c8 [2022-10-15 17:02:49,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:02:49,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:02:49,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:02:49,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:02:49,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:02:49,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:49,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c3169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49, skipping insertion in model container [2022-10-15 17:02:49,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:49,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:02:49,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:02:49,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c[4997,5010] [2022-10-15 17:02:49,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:02:49,623 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:02:49,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c[4997,5010] [2022-10-15 17:02:49,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:02:49,830 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:02:49,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49 WrapperNode [2022-10-15 17:02:49,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:02:49,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:02:49,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:02:49,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:02:49,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:49,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:49,966 INFO L138 Inliner]: procedures = 36, calls = 627, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 496 [2022-10-15 17:02:49,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:02:49,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:02:49,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:02:49,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:02:49,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:49,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:49,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:49,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:50,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:50,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:50,033 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:50,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:50,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:02:50,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:02:50,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:02:50,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:02:50,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (1/1) ... [2022-10-15 17:02:50,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:02:50,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:02:50,094 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) [2022-10-15 17:02:50,135 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 [2022-10-15 17:02:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:02:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:02:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:02:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:02:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure smp_send_req [2022-10-15 17:02:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-10-15 17:02:50,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-10-15 17:02:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:02:50,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 17:02:50,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:02:50,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:02:50,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-10-15 17:02:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-10-15 17:02:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:02:50,456 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:02:50,459 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:02:50,465 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 17:02:51,451 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:02:51,470 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:02:51,470 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:02:51,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:02:51 BoogieIcfgContainer [2022-10-15 17:02:51,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:02:51,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:02:51,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:02:51,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:02:51,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:02:49" (1/3) ... [2022-10-15 17:02:51,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f44f16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:02:51, skipping insertion in model container [2022-10-15 17:02:51,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:02:49" (2/3) ... [2022-10-15 17:02:51,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f44f16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:02:51, skipping insertion in model container [2022-10-15 17:02:51,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:02:51" (3/3) ... [2022-10-15 17:02:51,488 INFO L112 eAbstractionObserver]: Analyzing ICFG discover_list.c [2022-10-15 17:02:51,516 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:02:51,517 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2022-10-15 17:02:51,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:02:51,602 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=FINITE_AUTOMATA, 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;@26c56ff5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:02:51,603 INFO L358 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2022-10-15 17:02:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 119 states have (on average 2.042016806722689) internal successors, (243), 210 states have internal predecessors, (243), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:51,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:02:51,635 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:51,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:02:51,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1202726, now seen corresponding path program 1 times [2022-10-15 17:02:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:51,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873564773] [2022-10-15 17:02:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:52,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:52,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873564773] [2022-10-15 17:02:52,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873564773] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:52,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:52,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:02:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985062049] [2022-10-15 17:02:52,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:52,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:02:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:02:52,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:02:52,669 INFO L87 Difference]: Start difference. First operand has 221 states, 119 states have (on average 2.042016806722689) internal successors, (243), 210 states have internal predecessors, (243), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:52,787 INFO L93 Difference]: Finished difference Result 221 states and 255 transitions. [2022-10-15 17:02:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:02:52,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:02:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:52,815 INFO L225 Difference]: With dead ends: 221 [2022-10-15 17:02:52,815 INFO L226 Difference]: Without dead ends: 219 [2022-10-15 17:02:52,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:02:52,827 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 227 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:52,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 273 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:02:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-10-15 17:02:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-10-15 17:02:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 118 states have (on average 2.0084745762711864) internal successors, (237), 208 states have internal predecessors, (237), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2022-10-15 17:02:52,945 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 4 [2022-10-15 17:02:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:52,946 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2022-10-15 17:02:52,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2022-10-15 17:02:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:02:52,947 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:52,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:02:52,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:02:52,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1202664, now seen corresponding path program 1 times [2022-10-15 17:02:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:52,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389344546] [2022-10-15 17:02:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:53,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:53,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389344546] [2022-10-15 17:02:53,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389344546] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:53,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:53,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:02:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091465417] [2022-10-15 17:02:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:53,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:02:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:02:53,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:02:53,450 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:53,658 INFO L93 Difference]: Finished difference Result 220 states and 255 transitions. [2022-10-15 17:02:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:02:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:02:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:53,661 INFO L225 Difference]: With dead ends: 220 [2022-10-15 17:02:53,661 INFO L226 Difference]: Without dead ends: 220 [2022-10-15 17:02:53,662 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 [2022-10-15 17:02:53,664 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 197 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:53,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 154 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:02:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-15 17:02:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2022-10-15 17:02:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 122 states have (on average 1.959016393442623) internal successors, (239), 204 states have internal predecessors, (239), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 255 transitions. [2022-10-15 17:02:53,685 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 255 transitions. Word has length 4 [2022-10-15 17:02:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:53,685 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 255 transitions. [2022-10-15 17:02:53,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 255 transitions. [2022-10-15 17:02:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:02:53,686 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:53,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:02:53,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:02:53,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1202665, now seen corresponding path program 1 times [2022-10-15 17:02:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:53,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977777524] [2022-10-15 17:02:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977777524] [2022-10-15 17:02:54,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977777524] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:54,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:54,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:02:54,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139747537] [2022-10-15 17:02:54,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:54,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:02:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:54,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:02:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:02:54,314 INFO L87 Difference]: Start difference. First operand 215 states and 255 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:54,569 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2022-10-15 17:02:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:02:54,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:02:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:54,572 INFO L225 Difference]: With dead ends: 220 [2022-10-15 17:02:54,572 INFO L226 Difference]: Without dead ends: 220 [2022-10-15 17:02:54,573 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 [2022-10-15 17:02:54,575 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 143 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:54,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 226 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:02:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-15 17:02:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 207. [2022-10-15 17:02:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 122 states have (on average 1.8852459016393444) internal successors, (230), 196 states have internal predecessors, (230), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2022-10-15 17:02:54,603 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 4 [2022-10-15 17:02:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:54,604 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2022-10-15 17:02:54,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2022-10-15 17:02:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:02:54,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:54,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:02:54,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:02:54,608 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:54,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1468815954, now seen corresponding path program 1 times [2022-10-15 17:02:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:54,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854991426] [2022-10-15 17:02:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:55,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854991426] [2022-10-15 17:02:55,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854991426] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:55,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:55,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:02:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182157194] [2022-10-15 17:02:55,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:55,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:02:55,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:02:55,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:02:55,153 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:55,412 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2022-10-15 17:02:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:02:55,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:02:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:55,415 INFO L225 Difference]: With dead ends: 210 [2022-10-15 17:02:55,415 INFO L226 Difference]: Without dead ends: 210 [2022-10-15 17:02:55,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:02:55,418 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 354 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:55,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 149 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:02:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-10-15 17:02:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2022-10-15 17:02:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 122 states have (on average 1.8032786885245902) internal successors, (220), 186 states have internal predecessors, (220), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 236 transitions. [2022-10-15 17:02:55,430 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 236 transitions. Word has length 7 [2022-10-15 17:02:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:55,431 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 236 transitions. [2022-10-15 17:02:55,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 236 transitions. [2022-10-15 17:02:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:02:55,432 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:55,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:02:55,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:02:55,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1468815955, now seen corresponding path program 1 times [2022-10-15 17:02:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:55,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211595814] [2022-10-15 17:02:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:55,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:56,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211595814] [2022-10-15 17:02:56,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211595814] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:56,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:56,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:02:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286226767] [2022-10-15 17:02:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:56,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:02:56,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:56,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:02:56,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:02:56,564 INFO L87 Difference]: Start difference. First operand 197 states and 236 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:56,826 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2022-10-15 17:02:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:02:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:02:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:56,828 INFO L225 Difference]: With dead ends: 202 [2022-10-15 17:02:56,828 INFO L226 Difference]: Without dead ends: 202 [2022-10-15 17:02:56,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:02:56,836 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 321 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:56,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 185 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:02:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-10-15 17:02:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2022-10-15 17:02:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 178 states have internal predecessors, (212), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2022-10-15 17:02:56,854 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 7 [2022-10-15 17:02:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:56,855 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2022-10-15 17:02:56,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2022-10-15 17:02:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:02:56,867 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:56,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:02:56,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:02:56,868 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1284393230, now seen corresponding path program 1 times [2022-10-15 17:02:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:56,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688708820] [2022-10-15 17:02:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:57,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688708820] [2022-10-15 17:02:57,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688708820] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:57,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:57,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:02:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528250193] [2022-10-15 17:02:57,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:57,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:02:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:57,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:02:57,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:02:57,031 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:57,158 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2022-10-15 17:02:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:02:57,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:02:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:57,160 INFO L225 Difference]: With dead ends: 192 [2022-10-15 17:02:57,160 INFO L226 Difference]: Without dead ends: 192 [2022-10-15 17:02:57,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:02:57,164 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 1 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:57,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 763 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:02:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-10-15 17:02:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2022-10-15 17:02:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 180 states have internal predecessors, (214), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 230 transitions. [2022-10-15 17:02:57,180 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 230 transitions. Word has length 22 [2022-10-15 17:02:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:57,181 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 230 transitions. [2022-10-15 17:02:57,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 230 transitions. [2022-10-15 17:02:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:02:57,182 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:57,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:02:57,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:02:57,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1985457808, now seen corresponding path program 1 times [2022-10-15 17:02:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:57,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913307675] [2022-10-15 17:02:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:57,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913307675] [2022-10-15 17:02:57,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913307675] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:57,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:57,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:02:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366908520] [2022-10-15 17:02:57,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:57,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:02:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:02:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:02:57,316 INFO L87 Difference]: Start difference. First operand 191 states and 230 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:57,457 INFO L93 Difference]: Finished difference Result 200 states and 237 transitions. [2022-10-15 17:02:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:02:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:02:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:57,459 INFO L225 Difference]: With dead ends: 200 [2022-10-15 17:02:57,459 INFO L226 Difference]: Without dead ends: 200 [2022-10-15 17:02:57,460 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 [2022-10-15 17:02:57,461 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 148 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:57,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 148 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:02:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-10-15 17:02:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2022-10-15 17:02:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 124 states have (on average 1.6935483870967742) internal successors, (210), 176 states have internal predecessors, (210), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2022-10-15 17:02:57,469 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 22 [2022-10-15 17:02:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:57,470 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2022-10-15 17:02:57,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2022-10-15 17:02:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:02:57,472 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:57,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:02:57,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:02:57,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1985457809, now seen corresponding path program 1 times [2022-10-15 17:02:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:57,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697850374] [2022-10-15 17:02:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:57,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697850374] [2022-10-15 17:02:57,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697850374] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:57,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:57,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:02:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284246026] [2022-10-15 17:02:57,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:57,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:02:57,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:57,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:02:57,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:02:57,717 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:57,861 INFO L93 Difference]: Finished difference Result 183 states and 222 transitions. [2022-10-15 17:02:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:02:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:02:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:57,863 INFO L225 Difference]: With dead ends: 183 [2022-10-15 17:02:57,864 INFO L226 Difference]: Without dead ends: 183 [2022-10-15 17:02:57,864 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 [2022-10-15 17:02:57,865 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 150 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:57,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 141 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:02:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-10-15 17:02:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-10-15 17:02:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 172 states have internal predecessors, (206), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 222 transitions. [2022-10-15 17:02:57,873 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 222 transitions. Word has length 22 [2022-10-15 17:02:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:57,874 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 222 transitions. [2022-10-15 17:02:57,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:02:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 222 transitions. [2022-10-15 17:02:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 17:02:57,875 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:57,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:02:57,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:02:57,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1553045821, now seen corresponding path program 1 times [2022-10-15 17:02:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:57,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709355024] [2022-10-15 17:02:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 17:02:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:58,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709355024] [2022-10-15 17:02:58,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709355024] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:58,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:58,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:02:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477790250] [2022-10-15 17:02:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:58,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:02:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:58,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:02:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:02:58,980 INFO L87 Difference]: Start difference. First operand 183 states and 222 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:02:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:59,205 INFO L93 Difference]: Finished difference Result 184 states and 226 transitions. [2022-10-15 17:02:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:02:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-10-15 17:02:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:59,210 INFO L225 Difference]: With dead ends: 184 [2022-10-15 17:02:59,210 INFO L226 Difference]: Without dead ends: 184 [2022-10-15 17:02:59,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:02:59,212 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 189 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:59,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 261 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:02:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-15 17:02:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-10-15 17:02:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 123 states have (on average 1.6585365853658536) internal successors, (204), 170 states have internal predecessors, (204), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 220 transitions. [2022-10-15 17:02:59,223 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 220 transitions. Word has length 29 [2022-10-15 17:02:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:59,223 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 220 transitions. [2022-10-15 17:02:59,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:02:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 220 transitions. [2022-10-15 17:02:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 17:02:59,225 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:59,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:02:59,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:02:59,225 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash -460052090, now seen corresponding path program 1 times [2022-10-15 17:02:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147286197] [2022-10-15 17:02:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 17:02:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:02:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:02:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147286197] [2022-10-15 17:02:59,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147286197] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:02:59,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:02:59,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:02:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112180696] [2022-10-15 17:02:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:02:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:02:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:02:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:02:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:02:59,522 INFO L87 Difference]: Start difference. First operand 181 states and 220 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:02:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:02:59,687 INFO L93 Difference]: Finished difference Result 184 states and 223 transitions. [2022-10-15 17:02:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:02:59,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-10-15 17:02:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:02:59,689 INFO L225 Difference]: With dead ends: 184 [2022-10-15 17:02:59,689 INFO L226 Difference]: Without dead ends: 182 [2022-10-15 17:02:59,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:02:59,690 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 11 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:02:59,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 735 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:02:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-10-15 17:02:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-10-15 17:02:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 124 states have (on average 1.653225806451613) internal successors, (205), 171 states have internal predecessors, (205), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:02:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2022-10-15 17:02:59,698 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 33 [2022-10-15 17:02:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:02:59,699 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2022-10-15 17:02:59,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:02:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2022-10-15 17:02:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 17:02:59,700 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:02:59,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:02:59,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:02:59,701 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:02:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:02:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash 17870643, now seen corresponding path program 1 times [2022-10-15 17:02:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:02:59,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268719142] [2022-10-15 17:02:59,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:02:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:02:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:02:59,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 17:02:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:03:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:00,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:03:00,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268719142] [2022-10-15 17:03:00,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268719142] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:03:00,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987852455] [2022-10-15 17:03:00,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:03:00,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:03:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:03:00,072 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) [2022-10-15 17:03:00,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:03:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:03:00,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 17:03:00,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:03:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:00,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:03:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:00,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987852455] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:03:00,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:03:00,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-10-15 17:03:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966905235] [2022-10-15 17:03:00,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:03:00,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 17:03:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:03:00,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 17:03:00,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:03:00,507 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 17:03:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:03:00,957 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2022-10-15 17:03:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:03:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-10-15 17:03:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:03:00,959 INFO L225 Difference]: With dead ends: 194 [2022-10-15 17:03:00,960 INFO L226 Difference]: Without dead ends: 192 [2022-10-15 17:03:00,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-10-15 17:03:00,961 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 20 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:03:00,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1120 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:03:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-10-15 17:03:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-10-15 17:03:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 133 states have (on average 1.631578947368421) internal successors, (217), 180 states have internal predecessors, (217), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:03:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 233 transitions. [2022-10-15 17:03:00,969 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 233 transitions. Word has length 34 [2022-10-15 17:03:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:03:00,970 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 233 transitions. [2022-10-15 17:03:00,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 17:03:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 233 transitions. [2022-10-15 17:03:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 17:03:00,972 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:03:00,972 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:03:01,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:03:01,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-15 17:03:01,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:03:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:03:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1650371782, now seen corresponding path program 2 times [2022-10-15 17:03:01,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:03:01,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832202300] [2022-10-15 17:03:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:03:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:03:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:03:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 17:03:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:03:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:03:01,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832202300] [2022-10-15 17:03:01,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832202300] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:03:01,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335093648] [2022-10-15 17:03:01,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:03:01,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:03:01,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:03:01,674 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) [2022-10-15 17:03:01,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:03:02,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:03:02,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:03:02,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-15 17:03:02,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:03:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:02,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:03:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:03,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335093648] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:03:03,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:03:03,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2022-10-15 17:03:03,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733094584] [2022-10-15 17:03:03,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:03:03,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-15 17:03:03,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:03:03,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-15 17:03:03,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2022-10-15 17:03:03,235 INFO L87 Difference]: Start difference. First operand 192 states and 233 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 17:03:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:03:04,431 INFO L93 Difference]: Finished difference Result 211 states and 256 transitions. [2022-10-15 17:03:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-15 17:03:04,432 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-10-15 17:03:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:03:04,434 INFO L225 Difference]: With dead ends: 211 [2022-10-15 17:03:04,434 INFO L226 Difference]: Without dead ends: 201 [2022-10-15 17:03:04,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=350, Invalid=840, Unknown=0, NotChecked=0, Total=1190 [2022-10-15 17:03:04,436 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 41 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:03:04,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1903 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:03:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-10-15 17:03:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-10-15 17:03:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.5774647887323943) internal successors, (224), 189 states have internal predecessors, (224), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:03:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 240 transitions. [2022-10-15 17:03:04,443 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 240 transitions. Word has length 37 [2022-10-15 17:03:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:03:04,443 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 240 transitions. [2022-10-15 17:03:04,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 17:03:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 240 transitions. [2022-10-15 17:03:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 17:03:04,445 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:03:04,445 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:03:04,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:03:04,658 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,SelfDestructingSolverStorable11 [2022-10-15 17:03:04,659 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:03:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:03:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash 830907814, now seen corresponding path program 3 times [2022-10-15 17:03:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:03:04,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085001822] [2022-10-15 17:03:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:03:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:03:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:03:05,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 17:03:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:03:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:05,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:03:05,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085001822] [2022-10-15 17:03:05,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085001822] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:03:05,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677182410] [2022-10-15 17:03:05,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 17:03:05,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:03:05,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:03:05,516 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) [2022-10-15 17:03:05,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:03:07,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-15 17:03:07,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:03:07,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 31 conjunts are in the unsatisfiable core [2022-10-15 17:03:07,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:03:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:07,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:03:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:08,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677182410] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:03:08,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:03:08,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 39 [2022-10-15 17:03:08,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306092540] [2022-10-15 17:03:08,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:03:08,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-15 17:03:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:03:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-15 17:03:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1123, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 17:03:08,731 INFO L87 Difference]: Start difference. First operand 201 states and 240 transitions. Second operand has 39 states, 39 states have (on average 2.230769230769231) internal successors, (87), 38 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 17:03:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:03:21,788 INFO L93 Difference]: Finished difference Result 235 states and 284 transitions. [2022-10-15 17:03:21,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-15 17:03:21,789 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.230769230769231) internal successors, (87), 38 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-10-15 17:03:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:03:21,791 INFO L225 Difference]: With dead ends: 235 [2022-10-15 17:03:21,791 INFO L226 Difference]: Without dead ends: 219 [2022-10-15 17:03:21,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=1282, Invalid=3410, Unknown=0, NotChecked=0, Total=4692 [2022-10-15 17:03:21,795 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 283 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 17:03:21,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2550 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 17:03:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-10-15 17:03:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-10-15 17:03:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.5125) internal successors, (242), 207 states have internal predecessors, (242), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:03:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 258 transitions. [2022-10-15 17:03:21,804 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 258 transitions. Word has length 43 [2022-10-15 17:03:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:03:21,804 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 258 transitions. [2022-10-15 17:03:21,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.230769230769231) internal successors, (87), 38 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 17:03:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2022-10-15 17:03:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 17:03:21,810 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:03:21,810 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:03:21,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:03:22,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:03:22,024 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:03:22,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:03:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash 132259686, now seen corresponding path program 4 times [2022-10-15 17:03:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:03:22,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161724768] [2022-10-15 17:03:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:03:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:03:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:03:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 17:03:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:03:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:24,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:03:24,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161724768] [2022-10-15 17:03:24,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161724768] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:03:24,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848342721] [2022-10-15 17:03:24,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-15 17:03:24,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:03:24,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:03:24,079 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) [2022-10-15 17:03:24,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:03:24,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-15 17:03:24,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:03:24,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-15 17:03:24,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:03:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:25,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:03:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:03:28,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848342721] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:03:28,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:03:28,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 74 [2022-10-15 17:03:28,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018380340] [2022-10-15 17:03:28,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:03:28,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-10-15 17:03:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:03:28,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-10-15 17:03:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=4571, Unknown=0, NotChecked=0, Total=5402 [2022-10-15 17:03:28,101 INFO L87 Difference]: Start difference. First operand 219 states and 258 transitions. Second operand has 74 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 73 states have internal predecessors, (103), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 17:03:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:03:31,950 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2022-10-15 17:03:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-10-15 17:03:31,951 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 73 states have internal predecessors, (103), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-10-15 17:03:31,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:03:31,953 INFO L225 Difference]: With dead ends: 261 [2022-10-15 17:03:31,953 INFO L226 Difference]: Without dead ends: 233 [2022-10-15 17:03:31,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1943, Invalid=10489, Unknown=0, NotChecked=0, Total=12432 [2022-10-15 17:03:31,959 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 132 mSDsluCounter, 7017 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 7234 SdHoareTripleChecker+Invalid, 2766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-10-15 17:03:31,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 7234 Invalid, 2766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-10-15 17:03:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-10-15 17:03:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-10-15 17:03:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 174 states have (on average 1.471264367816092) internal successors, (256), 221 states have internal predecessors, (256), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:03:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 272 transitions. [2022-10-15 17:03:31,967 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 272 transitions. Word has length 55 [2022-10-15 17:03:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:03:31,968 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 272 transitions. [2022-10-15 17:03:31,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 73 states have internal predecessors, (103), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 17:03:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 272 transitions. [2022-10-15 17:03:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 17:03:31,969 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:03:31,969 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:03:31,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-15 17:03:32,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:03:32,183 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2022-10-15 17:03:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:03:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash -70460154, now seen corresponding path program 5 times [2022-10-15 17:03:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:03:32,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285159057] [2022-10-15 17:03:32,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:03:32,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:03:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:03:32,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:03:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:03:32,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:03:32,450 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:03:32,451 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_LEAK (93 of 94 remaining) [2022-10-15 17:03:32,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 94 remaining) [2022-10-15 17:03:32,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 94 remaining) [2022-10-15 17:03:32,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 94 remaining) [2022-10-15 17:03:32,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 94 remaining) [2022-10-15 17:03:32,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 94 remaining) [2022-10-15 17:03:32,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 94 remaining) [2022-10-15 17:03:32,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 94 remaining) [2022-10-15 17:03:32,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 94 remaining) [2022-10-15 17:03:32,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 94 remaining) [2022-10-15 17:03:32,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 94 remaining) [2022-10-15 17:03:32,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 94 remaining) [2022-10-15 17:03:32,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 94 remaining) [2022-10-15 17:03:32,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 94 remaining) [2022-10-15 17:03:32,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2022-10-15 17:03:32,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2022-10-15 17:03:32,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2022-10-15 17:03:32,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2022-10-15 17:03:32,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2022-10-15 17:03:32,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2022-10-15 17:03:32,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2022-10-15 17:03:32,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2022-10-15 17:03:32,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2022-10-15 17:03:32,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2022-10-15 17:03:32,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2022-10-15 17:03:32,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2022-10-15 17:03:32,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2022-10-15 17:03:32,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2022-10-15 17:03:32,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2022-10-15 17:03:32,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2022-10-15 17:03:32,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2022-10-15 17:03:32,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2022-10-15 17:03:32,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2022-10-15 17:03:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2022-10-15 17:03:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2022-10-15 17:03:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2022-10-15 17:03:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2022-10-15 17:03:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2022-10-15 17:03:32,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2022-10-15 17:03:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 94 remaining) [2022-10-15 17:03:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2022-10-15 17:03:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2022-10-15 17:03:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2022-10-15 17:03:32,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2022-10-15 17:03:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2022-10-15 17:03:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2022-10-15 17:03:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2022-10-15 17:03:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2022-10-15 17:03:32,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 94 remaining) [2022-10-15 17:03:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 94 remaining) [2022-10-15 17:03:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 94 remaining) [2022-10-15 17:03:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 94 remaining) [2022-10-15 17:03:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 94 remaining) [2022-10-15 17:03:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2022-10-15 17:03:32,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2022-10-15 17:03:32,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2022-10-15 17:03:32,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2022-10-15 17:03:32,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2022-10-15 17:03:32,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2022-10-15 17:03:32,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2022-10-15 17:03:32,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2022-10-15 17:03:32,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2022-10-15 17:03:32,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2022-10-15 17:03:32,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2022-10-15 17:03:32,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2022-10-15 17:03:32,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 94 remaining) [2022-10-15 17:03:32,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2022-10-15 17:03:32,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2022-10-15 17:03:32,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2022-10-15 17:03:32,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2022-10-15 17:03:32,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2022-10-15 17:03:32,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2022-10-15 17:03:32,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2022-10-15 17:03:32,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2022-10-15 17:03:32,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2022-10-15 17:03:32,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2022-10-15 17:03:32,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2022-10-15 17:03:32,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2022-10-15 17:03:32,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2022-10-15 17:03:32,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2022-10-15 17:03:32,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2022-10-15 17:03:32,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 94 remaining) [2022-10-15 17:03:32,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 94 remaining) [2022-10-15 17:03:32,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 94 remaining) [2022-10-15 17:03:32,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 94 remaining) [2022-10-15 17:03:32,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 94 remaining) [2022-10-15 17:03:32,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 94 remaining) [2022-10-15 17:03:32,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 94 remaining) [2022-10-15 17:03:32,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 94 remaining) [2022-10-15 17:03:32,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 94 remaining) [2022-10-15 17:03:32,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 94 remaining) [2022-10-15 17:03:32,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 94 remaining) [2022-10-15 17:03:32,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 94 remaining) [2022-10-15 17:03:32,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 94 remaining) [2022-10-15 17:03:32,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 17:03:32,477 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:03:32,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:03:32,505 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2022-10-15 17:03:32,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:03:32 BoogieIcfgContainer [2022-10-15 17:03:32,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:03:32,558 INFO L158 Benchmark]: Toolchain (without parser) took 43399.84ms. Allocated memory was 162.5MB in the beginning and 342.9MB in the end (delta: 180.4MB). Free memory was 136.0MB in the beginning and 180.5MB in the end (delta: -44.5MB). Peak memory consumption was 136.7MB. Max. memory is 8.0GB. [2022-10-15 17:03:32,559 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 162.5MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:03:32,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.22ms. Allocated memory is still 162.5MB. Free memory was 135.8MB in the beginning and 115.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-10-15 17:03:32,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.12ms. Allocated memory is still 162.5MB. Free memory was 115.7MB in the beginning and 111.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-15 17:03:32,560 INFO L158 Benchmark]: Boogie Preprocessor took 75.40ms. Allocated memory is still 162.5MB. Free memory was 111.5MB in the beginning and 108.2MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 17:03:32,560 INFO L158 Benchmark]: RCFGBuilder took 1430.37ms. Allocated memory is still 162.5MB. Free memory was 108.2MB in the beginning and 99.3MB in the end (delta: 8.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-10-15 17:03:32,561 INFO L158 Benchmark]: TraceAbstraction took 41080.04ms. Allocated memory was 162.5MB in the beginning and 342.9MB in the end (delta: 180.4MB). Free memory was 98.3MB in the beginning and 180.5MB in the end (delta: -82.3MB). Peak memory consumption was 97.5MB. Max. memory is 8.0GB. [2022-10-15 17:03:32,562 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.40ms. Allocated memory is still 162.5MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 664.22ms. Allocated memory is still 162.5MB. Free memory was 135.8MB in the beginning and 115.7MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 135.12ms. Allocated memory is still 162.5MB. Free memory was 115.7MB in the beginning and 111.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.40ms. Allocated memory is still 162.5MB. Free memory was 111.5MB in the beginning and 108.2MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1430.37ms. Allocated memory is still 162.5MB. Free memory was 108.2MB in the beginning and 99.3MB in the end (delta: 8.8MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * TraceAbstraction took 41080.04ms. Allocated memory was 162.5MB in the beginning and 342.9MB in the end (delta: 180.4MB). Free memory was 98.3MB in the beginning and 180.5MB in the end (delta: -82.3MB). Peak memory consumption was 97.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) * 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 - UnprovableResult [Line: 491]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseAnd at line 434, overapproximation of memtrack at line 491. Possible FailurePath: [L121] int __tmpTR__int_1; [L150] struct smp_func_def_rrlen smp_def_rrlen_arr [32] = {{0x0, 0, 6}, {0x1, 0, 14}, {0x2, -3, -3}, {0x3, -2, -2}, {0x4, -2, -2}, {0x5, -2, -2}, {0x6, -2, -2}, {0x7, -3, -3}, {0x10, 2, 0xc}, {0x11, 2, 6}, {0x12, 2, 13}, {0x13, 2, 9}, {0x14, -2, -2}, {0x20, -2, -2}, {0x21, -2, -2}, {0x22, -2, -2}, {0x80, 3, 0}, {0x81, -2, 0}, {0x82, -3, -3}, {0x83, -3, -3}, {0x85, -2, 0}, {0x86, -2, -2}, {0x87, -2, 0}, {0x88, -2, 0}, {0x89, -2, 0}, {0x8a, -2, 0}, {0x8b, -2, 0}, {0x90, 9, 0}, {0x91, 9, 0}, {0x92, 9, 0}, {0x93, -2, 0}, {-1, -1, -1}}; VAL [__tmpTR__int_1=0, smp_def_rrlen_arr={12:0}] [L492] struct smp_target_obj tobj; [L493] struct opts_t opts; [L494] unsigned char * resp; [L495] resp= (unsigned char *) malloc (sizeof (unsigned char)) [L496] CALL, EXPR do_discover_list( & tobj, __VERIFIER_nondet_int() , resp, sizeof (resp), & opts) [L416] unsigned char smp_req [32] = {0x40, 0x20, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L417] struct smp_req_resp smp_rr; [L418] int len; [L419] int res; [L420] int dword_resp_len; [L421] int mnum_desc; [L422] dword_resp_len = (max_resp_len - 8) / 4 VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, op={39:0}, op={39:0}, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L423] EXPR (dword_resp_len < 0x100) ? dword_resp_len : 0xff VAL [(dword_resp_len < 0x100) ? dword_resp_len : 0xff=-1, \old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, op={39:0}, op={39:0}, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L423] smp_req[2] = (dword_resp_len < 0x100) ? dword_resp_len : 0xff VAL [(dword_resp_len < 0x100) ? dword_resp_len : 0xff=-1, \old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, op={39:0}, op={39:0}, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L424] smp_req[8] = sphy_id VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, op={39:0}, op={39:0}, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L425] EXPR op->do_num VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, op={39:0}, op={39:0}, op->do_num=42, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L425] mnum_desc = op->do_num [L426] EXPR op->desc_type VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=42, op={39:0}, op={39:0}, op->desc_type=0, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L426] COND TRUE (0 == op->desc_type) && (mnum_desc > 8) [L427] mnum_desc = 8 VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L428] EXPR op->desc_type VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, op->desc_type=0, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L428] COND FALSE !((1 == op->desc_type) && (mnum_desc > 40)) [L430] smp_req[9] = mnum_desc VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L431] EXPR op->filter VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, op->filter=385, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L431] smp_req[10] = op->filter & 0xf VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, op->filter=385, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L432] op->ign_zp VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, op->ign_zp=0, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L432] COND FALSE !(op->ign_zp) [L434] EXPR op->desc_type VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, op->desc_type=0, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L434] smp_req[11] = op->desc_type & 0xf VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, op->desc_type=0, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L435] FCALL memset( & smp_rr, 0, sizeof (smp_rr)) VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, memset( & smp_rr, 0, sizeof (smp_rr))={35:0}, mnum_desc=8, op={39:0}, op={39:0}, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L436] EXPR op->verbose VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, op->verbose=386, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, smp_req={41:0}, smp_rr={35:0}, sphy_id=-4, top={38:0}, top={38:0}] [L436] res = smp_send_req(top, & smp_rr, op->verbose) [L437] COND TRUE \read(res) [L439] return -1; [L416] unsigned char smp_req [32] = {0x40, 0x20, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L439] return -1; [L439] return -1; VAL [\old(max_resp_len)=4, \old(sphy_id)=-4, \result=-1, __tmpTR__int_1=0, dword_resp_len=-1, max_resp_len=4, mnum_desc=8, op={39:0}, op={39:0}, res=1, resp={-5:0}, resp={-5:0}, smp_def_rrlen_arr={12:0}, sphy_id=-4, top={38:0}, top={38:0}] [L496] RET, EXPR do_discover_list( & tobj, __VERIFIER_nondet_int() , resp, sizeof (resp), & opts) [L496] int ret = do_discover_list( & tobj, __VERIFIER_nondet_int() , resp, sizeof (resp), & opts); [L497] return 0; [L497] return 0; [L497] return 0; VAL [\result=0, __tmpTR__int_1=0, resp={-5:0}, ret=-1, smp_def_rrlen_arr={12:0}] - 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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 155]: 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 3 procedures, 221 locations, 94 error locations. Started 1 CEGAR loops. OverallTime: 40.9s, OverallIterations: 15, TraceHistogramMax: 24, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2283 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2217 mSDsluCounter, 15842 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13360 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5167 IncrementalHoareTripleChecker+Invalid, 5656 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 2482 mSDtfsCounter, 5167 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 271 SyntacticMatches, 4 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=14, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 61 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 2888 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2691 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 0/957 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 could not prove your program: unable to determine feasibility of some traces [2022-10-15 17:03:32,586 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...