/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/systemc/token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:49:33,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:49:33,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:49:33,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:49:33,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:49:33,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:49:33,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:49:33,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:49:33,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:49:33,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:49:33,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:49:33,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:49:33,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:49:33,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:49:33,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:49:33,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:49:33,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:49:33,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:49:33,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:49:33,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:49:33,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:49:33,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:49:33,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:49:33,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:49:33,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:49:33,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:49:33,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:49:33,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:49:33,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:49:33,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:49:33,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:49:33,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:49:33,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:49:33,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:49:33,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:49:33,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:49:33,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:49:33,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:49:33,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:49:33,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:49:33,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:49:33,403 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:49:33,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:49:33,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:49:33,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:49:33,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:49:33,483 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:49:33,484 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:49:33,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:49:33,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:49:33,488 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:49:33,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:49:33,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:49:33,490 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:49:33,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:49:33,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:49:33,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:49:33,491 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:49:33,491 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:49:33,492 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:49:33,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:49:33,492 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:49:33,492 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:49:33,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:49:33,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:49:33,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:49:33,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:49:33,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:49:33,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:49:33,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:49:33,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:49:33,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:49:33,495 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:49:34,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:49:34,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:49:34,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:49:34,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:49:34,080 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:49:34,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-10-15 17:49:34,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f870c9f02/f8489e8644794f6c93649e13fd0e4f8f/FLAG0e46d63cd [2022-10-15 17:49:34,886 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:49:34,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2022-10-15 17:49:34,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f870c9f02/f8489e8644794f6c93649e13fd0e4f8f/FLAG0e46d63cd [2022-10-15 17:49:35,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f870c9f02/f8489e8644794f6c93649e13fd0e4f8f [2022-10-15 17:49:35,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:49:35,206 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:49:35,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:49:35,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:49:35,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:49:35,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d377da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35, skipping insertion in model container [2022-10-15 17:49:35,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:49:35,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:49:35,436 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/systemc/token_ring.01.cil-2.c[671,684] [2022-10-15 17:49:35,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:49:35,551 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:49:35,575 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/systemc/token_ring.01.cil-2.c[671,684] [2022-10-15 17:49:35,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:49:35,687 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:49:35,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35 WrapperNode [2022-10-15 17:49:35,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:49:35,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:49:35,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:49:35,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:49:35,702 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:49:35" (1/1) ... [2022-10-15 17:49:35,715 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:49:35" (1/1) ... [2022-10-15 17:49:35,752 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 220 [2022-10-15 17:49:35,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:49:35,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:49:35,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:49:35,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:49:35,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,797 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:49:35,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:49:35,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:49:35,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:49:35,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (1/1) ... [2022-10-15 17:49:35,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:49:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:35,854 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:49:35,878 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:49:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:49:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-10-15 17:49:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-10-15 17:49:35,940 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-15 17:49:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-15 17:49:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-15 17:49:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-15 17:49:35,941 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-10-15 17:49:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-10-15 17:49:35,942 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-15 17:49:35,942 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-15 17:49:35,942 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-15 17:49:35,942 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-15 17:49:35,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:49:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-15 17:49:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-15 17:49:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:49:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:49:36,050 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:49:36,055 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:49:36,800 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:49:36,813 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:49:36,813 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-15 17:49:36,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:49:36 BoogieIcfgContainer [2022-10-15 17:49:36,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:49:36,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:49:36,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:49:36,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:49:36,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:49:35" (1/3) ... [2022-10-15 17:49:36,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6418307d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:49:36, skipping insertion in model container [2022-10-15 17:49:36,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:49:35" (2/3) ... [2022-10-15 17:49:36,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6418307d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:49:36, skipping insertion in model container [2022-10-15 17:49:36,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:49:36" (3/3) ... [2022-10-15 17:49:36,834 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2022-10-15 17:49:36,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:49:36,871 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:49:36,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:49:37,008 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;@152706e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:49:37,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:49:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 94 states have internal predecessors, (139), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-10-15 17:49:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-15 17:49:37,035 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:37,037 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:37,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:37,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1131173082, now seen corresponding path program 1 times [2022-10-15 17:49:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:37,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680608245] [2022-10-15 17:49:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:37,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:37,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:37,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:37,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:37,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:37,920 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:49:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:37,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680608245] [2022-10-15 17:49:37,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680608245] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:37,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:37,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:37,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215329424] [2022-10-15 17:49:37,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:37,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:37,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:37,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:37,988 INFO L87 Difference]: Start difference. First operand has 116 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 94 states have internal predecessors, (139), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:49:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:39,164 INFO L93 Difference]: Finished difference Result 257 states and 368 transitions. [2022-10-15 17:49:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:49:39,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-10-15 17:49:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:39,208 INFO L225 Difference]: With dead ends: 257 [2022-10-15 17:49:39,209 INFO L226 Difference]: Without dead ends: 253 [2022-10-15 17:49:39,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:49:39,221 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 310 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:39,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 507 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-15 17:49:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-10-15 17:49:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 207. [2022-10-15 17:49:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 165 states have (on average 1.4727272727272727) internal successors, (243), 169 states have internal predecessors, (243), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-10-15 17:49:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 298 transitions. [2022-10-15 17:49:39,389 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 298 transitions. Word has length 42 [2022-10-15 17:49:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:39,391 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 298 transitions. [2022-10-15 17:49:39,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:49:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2022-10-15 17:49:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 17:49:39,399 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:39,399 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, 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:49:39,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:49:39,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1286237, now seen corresponding path program 1 times [2022-10-15 17:49:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:39,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674857036] [2022-10-15 17:49:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:39,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:39,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:39,878 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:49:39,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:39,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674857036] [2022-10-15 17:49:39,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674857036] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:39,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:39,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:49:39,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276958873] [2022-10-15 17:49:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:39,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:49:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:39,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:49:39,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:39,886 INFO L87 Difference]: Start difference. First operand 207 states and 298 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:40,812 INFO L93 Difference]: Finished difference Result 366 states and 525 transitions. [2022-10-15 17:49:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:49:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-10-15 17:49:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:40,818 INFO L225 Difference]: With dead ends: 366 [2022-10-15 17:49:40,818 INFO L226 Difference]: Without dead ends: 366 [2022-10-15 17:49:40,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:49:40,821 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 291 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:40,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 825 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 17:49:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-10-15 17:49:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 297. [2022-10-15 17:49:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 238 states have (on average 1.4663865546218486) internal successors, (349), 243 states have internal predecessors, (349), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-10-15 17:49:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 426 transitions. [2022-10-15 17:49:40,863 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 426 transitions. Word has length 57 [2022-10-15 17:49:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:40,864 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 426 transitions. [2022-10-15 17:49:40,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 426 transitions. [2022-10-15 17:49:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 17:49:40,870 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:40,872 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, 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:49:40,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:49:40,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 894772575, now seen corresponding path program 1 times [2022-10-15 17:49:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:40,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492691922] [2022-10-15 17:49:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:41,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:41,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:41,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:41,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:41,169 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:49:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492691922] [2022-10-15 17:49:41,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492691922] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:41,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:41,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:49:41,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550624014] [2022-10-15 17:49:41,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:41,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:49:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:41,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:49:41,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:41,177 INFO L87 Difference]: Start difference. First operand 297 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:41,964 INFO L93 Difference]: Finished difference Result 627 states and 894 transitions. [2022-10-15 17:49:41,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:49:41,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-10-15 17:49:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:41,971 INFO L225 Difference]: With dead ends: 627 [2022-10-15 17:49:41,972 INFO L226 Difference]: Without dead ends: 627 [2022-10-15 17:49:41,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-15 17:49:41,975 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 345 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:41,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 807 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 17:49:41,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-10-15 17:49:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 472. [2022-10-15 17:49:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 381 states have (on average 1.4645669291338583) internal successors, (558), 388 states have internal predecessors, (558), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-10-15 17:49:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 679 transitions. [2022-10-15 17:49:42,018 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 679 transitions. Word has length 57 [2022-10-15 17:49:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:42,018 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 679 transitions. [2022-10-15 17:49:42,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 679 transitions. [2022-10-15 17:49:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 17:49:42,023 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:42,023 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, 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:49:42,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:49:42,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1154615267, now seen corresponding path program 1 times [2022-10-15 17:49:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:42,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735459427] [2022-10-15 17:49:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:42,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:42,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:42,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:42,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:42,192 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:49:42,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:42,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735459427] [2022-10-15 17:49:42,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735459427] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:42,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:42,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:49:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299415522] [2022-10-15 17:49:42,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:42,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:49:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:42,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:49:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:42,197 INFO L87 Difference]: Start difference. First operand 472 states and 679 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:43,004 INFO L93 Difference]: Finished difference Result 1004 states and 1432 transitions. [2022-10-15 17:49:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:49:43,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-10-15 17:49:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:43,014 INFO L225 Difference]: With dead ends: 1004 [2022-10-15 17:49:43,014 INFO L226 Difference]: Without dead ends: 1004 [2022-10-15 17:49:43,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-15 17:49:43,017 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 288 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:43,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 790 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 17:49:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-10-15 17:49:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 771. [2022-10-15 17:49:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 622 states have (on average 1.4437299035369775) internal successors, (898), 633 states have internal predecessors, (898), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2022-10-15 17:49:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1105 transitions. [2022-10-15 17:49:43,069 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1105 transitions. Word has length 57 [2022-10-15 17:49:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:43,070 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 1105 transitions. [2022-10-15 17:49:43,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1105 transitions. [2022-10-15 17:49:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 17:49:43,075 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:43,075 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, 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:49:43,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:49:43,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:43,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2052008545, now seen corresponding path program 1 times [2022-10-15 17:49:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:43,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773231937] [2022-10-15 17:49:43,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:43,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:43,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:43,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:43,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:43,199 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:49:43,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:43,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773231937] [2022-10-15 17:49:43,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773231937] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:43,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:43,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114150094] [2022-10-15 17:49:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:43,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:43,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:43,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:43,207 INFO L87 Difference]: Start difference. First operand 771 states and 1105 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:43,920 INFO L93 Difference]: Finished difference Result 1380 states and 1932 transitions. [2022-10-15 17:49:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:49:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-10-15 17:49:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:43,932 INFO L225 Difference]: With dead ends: 1380 [2022-10-15 17:49:43,933 INFO L226 Difference]: Without dead ends: 1380 [2022-10-15 17:49:43,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:49:43,935 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 403 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:43,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 600 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 17:49:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2022-10-15 17:49:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1172. [2022-10-15 17:49:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 940 states have (on average 1.4138297872340426) internal successors, (1329), 960 states have internal predecessors, (1329), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2022-10-15 17:49:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1644 transitions. [2022-10-15 17:49:44,027 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1644 transitions. Word has length 57 [2022-10-15 17:49:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:44,028 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1644 transitions. [2022-10-15 17:49:44,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:49:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1644 transitions. [2022-10-15 17:49:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-15 17:49:44,034 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:44,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:44,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:49:44,036 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:44,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2091151759, now seen corresponding path program 1 times [2022-10-15 17:49:44,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:44,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193260916] [2022-10-15 17:49:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-15 17:49:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 17:49:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 17:49:44,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:44,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193260916] [2022-10-15 17:49:44,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193260916] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:44,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260343574] [2022-10-15 17:49:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:44,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:44,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:44,309 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:49:44,337 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:49:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:44,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:44,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 17:49:44,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:44,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260343574] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:44,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:44,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-15 17:49:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990380757] [2022-10-15 17:49:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:44,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:44,488 INFO L87 Difference]: Start difference. First operand 1172 states and 1644 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:44,595 INFO L93 Difference]: Finished difference Result 2223 states and 3112 transitions. [2022-10-15 17:49:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-10-15 17:49:44,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:44,618 INFO L225 Difference]: With dead ends: 2223 [2022-10-15 17:49:44,618 INFO L226 Difference]: Without dead ends: 2223 [2022-10-15 17:49:44,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:44,627 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 117 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:44,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 430 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2022-10-15 17:49:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2220. [2022-10-15 17:49:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 1779 states have (on average 1.3934794828555368) internal successors, (2479), 1812 states have internal predecessors, (2479), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2022-10-15 17:49:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3110 transitions. [2022-10-15 17:49:44,743 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3110 transitions. Word has length 92 [2022-10-15 17:49:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:44,747 INFO L495 AbstractCegarLoop]: Abstraction has 2220 states and 3110 transitions. [2022-10-15 17:49:44,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3110 transitions. [2022-10-15 17:49:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-15 17:49:44,768 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:44,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:44,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 17:49:44,982 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,SelfDestructingSolverStorable5 [2022-10-15 17:49:44,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash 742794920, now seen corresponding path program 1 times [2022-10-15 17:49:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:44,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623001104] [2022-10-15 17:49:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:49:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-15 17:49:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-15 17:49:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-15 17:49:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-15 17:49:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-15 17:49:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-15 17:49:45,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:45,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623001104] [2022-10-15 17:49:45,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623001104] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:45,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825085261] [2022-10-15 17:49:45,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:45,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:45,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:45,246 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:49:45,256 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:49:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:45,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:45,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-15 17:49:45,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:45,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825085261] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:45,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:45,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-10-15 17:49:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282957847] [2022-10-15 17:49:45,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:45,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:45,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:45,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:45,596 INFO L87 Difference]: Start difference. First operand 2220 states and 3110 transitions. Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-10-15 17:49:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:45,660 INFO L93 Difference]: Finished difference Result 2219 states and 3109 transitions. [2022-10-15 17:49:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:45,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2022-10-15 17:49:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:45,678 INFO L225 Difference]: With dead ends: 2219 [2022-10-15 17:49:45,679 INFO L226 Difference]: Without dead ends: 2217 [2022-10-15 17:49:45,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:45,680 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 54 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:45,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 209 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2022-10-15 17:49:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2022-10-15 17:49:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1777 states have (on average 1.37816544738323) internal successors, (2449), 1809 states have internal predecessors, (2449), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2022-10-15 17:49:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3080 transitions. [2022-10-15 17:49:45,777 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3080 transitions. Word has length 106 [2022-10-15 17:49:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:45,778 INFO L495 AbstractCegarLoop]: Abstraction has 2217 states and 3080 transitions. [2022-10-15 17:49:45,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-10-15 17:49:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3080 transitions. [2022-10-15 17:49:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-10-15 17:49:45,788 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:45,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:45,836 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:49:46,003 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,SelfDestructingSolverStorable6 [2022-10-15 17:49:46,003 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:46,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash 584349113, now seen corresponding path program 1 times [2022-10-15 17:49:46,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:46,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623383872] [2022-10-15 17:49:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:46,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-15 17:49:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 17:49:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-10-15 17:49:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 17:49:46,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:46,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623383872] [2022-10-15 17:49:46,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623383872] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:46,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120821622] [2022-10-15 17:49:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:46,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:46,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:46,278 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:49:46,286 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:49:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:46,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:46,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 17:49:46,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:46,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120821622] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:46,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:46,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-10-15 17:49:46,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990535303] [2022-10-15 17:49:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:46,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:46,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:46,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:46,558 INFO L87 Difference]: Start difference. First operand 2217 states and 3080 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-15 17:49:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:46,619 INFO L93 Difference]: Finished difference Result 4284 states and 5869 transitions. [2022-10-15 17:49:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2022-10-15 17:49:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:46,675 INFO L225 Difference]: With dead ends: 4284 [2022-10-15 17:49:46,675 INFO L226 Difference]: Without dead ends: 4284 [2022-10-15 17:49:46,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:46,677 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 81 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:46,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 315 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2022-10-15 17:49:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4224. [2022-10-15 17:49:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4224 states, 3390 states have (on average 1.370796460176991) internal successors, (4647), 3451 states have internal predecessors, (4647), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2022-10-15 17:49:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 5810 transitions. [2022-10-15 17:49:46,870 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 5810 transitions. Word has length 118 [2022-10-15 17:49:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:46,871 INFO L495 AbstractCegarLoop]: Abstraction has 4224 states and 5810 transitions. [2022-10-15 17:49:46,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-15 17:49:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 5810 transitions. [2022-10-15 17:49:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-10-15 17:49:46,887 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:46,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:46,936 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:49:47,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:47,102 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:47,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1086835591, now seen corresponding path program 1 times [2022-10-15 17:49:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:47,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776916242] [2022-10-15 17:49:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-15 17:49:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-15 17:49:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-15 17:49:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-10-15 17:49:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-10-15 17:49:47,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:47,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776916242] [2022-10-15 17:49:47,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776916242] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:47,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793898827] [2022-10-15 17:49:47,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:47,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:47,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:47,329 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:49:47,352 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:49:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:47,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:49:47,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 17:49:47,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:47,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793898827] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:47,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:47,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-15 17:49:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999961139] [2022-10-15 17:49:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:47,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:47,501 INFO L87 Difference]: Start difference. First operand 4224 states and 5810 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-15 17:49:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:47,561 INFO L93 Difference]: Finished difference Result 4552 states and 6140 transitions. [2022-10-15 17:49:47,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:47,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 134 [2022-10-15 17:49:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:47,593 INFO L225 Difference]: With dead ends: 4552 [2022-10-15 17:49:47,594 INFO L226 Difference]: Without dead ends: 4552 [2022-10-15 17:49:47,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:47,595 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 101 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:47,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 314 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2022-10-15 17:49:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4514. [2022-10-15 17:49:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4514 states, 3648 states have (on average 1.3434758771929824) internal successors, (4901), 3709 states have internal predecessors, (4901), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-10-15 17:49:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 6102 transitions. [2022-10-15 17:49:47,808 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 6102 transitions. Word has length 134 [2022-10-15 17:49:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:47,809 INFO L495 AbstractCegarLoop]: Abstraction has 4514 states and 6102 transitions. [2022-10-15 17:49:47,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-15 17:49:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 6102 transitions. [2022-10-15 17:49:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-10-15 17:49:47,825 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:47,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:47,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:48,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:48,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:48,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash 740195695, now seen corresponding path program 1 times [2022-10-15 17:49:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:48,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998735552] [2022-10-15 17:49:48,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 17:49:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 17:49:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-10-15 17:49:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-15 17:49:48,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:48,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998735552] [2022-10-15 17:49:48,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998735552] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:48,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786782704] [2022-10-15 17:49:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:48,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:48,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:48,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:48,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 17:49:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:48,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:49:48,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 17:49:48,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:48,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786782704] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:48,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:48,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-15 17:49:48,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450425376] [2022-10-15 17:49:48,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:48,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:48,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:48,405 INFO L87 Difference]: Start difference. First operand 4514 states and 6102 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-15 17:49:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:48,478 INFO L93 Difference]: Finished difference Result 4550 states and 6043 transitions. [2022-10-15 17:49:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-10-15 17:49:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:48,515 INFO L225 Difference]: With dead ends: 4550 [2022-10-15 17:49:48,515 INFO L226 Difference]: Without dead ends: 4550 [2022-10-15 17:49:48,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:48,517 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 111 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:48,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 400 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2022-10-15 17:49:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4490. [2022-10-15 17:49:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 3624 states have (on average 1.319812362030905) internal successors, (4783), 3685 states have internal predecessors, (4783), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2022-10-15 17:49:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 5984 transitions. [2022-10-15 17:49:48,792 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 5984 transitions. Word has length 135 [2022-10-15 17:49:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:48,793 INFO L495 AbstractCegarLoop]: Abstraction has 4490 states and 5984 transitions. [2022-10-15 17:49:48,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-15 17:49:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 5984 transitions. [2022-10-15 17:49:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-10-15 17:49:48,814 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:48,814 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:48,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:49,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-15 17:49:49,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1609069135, now seen corresponding path program 1 times [2022-10-15 17:49:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:49,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069622791] [2022-10-15 17:49:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 17:49:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 17:49:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-10-15 17:49:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-15 17:49:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:49,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069622791] [2022-10-15 17:49:49,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069622791] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:49,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211789926] [2022-10-15 17:49:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:49,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:49,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:49,266 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:49,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 17:49:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:49:49,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-15 17:49:49,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:49,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211789926] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:49,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:49,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-15 17:49:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801137496] [2022-10-15 17:49:49,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:49,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:49:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:49:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:49,424 INFO L87 Difference]: Start difference. First operand 4490 states and 5984 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-15 17:49:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:49,475 INFO L93 Difference]: Finished difference Result 3872 states and 4918 transitions. [2022-10-15 17:49:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:49:49,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-10-15 17:49:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:49,501 INFO L225 Difference]: With dead ends: 3872 [2022-10-15 17:49:49,501 INFO L226 Difference]: Without dead ends: 3872 [2022-10-15 17:49:49,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:49:49,503 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:49,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2022-10-15 17:49:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3642. [2022-10-15 17:49:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3642 states, 2942 states have (on average 1.270904146838885) internal successors, (3739), 2987 states have internal predecessors, (3739), 393 states have call successors, (393), 275 states have call predecessors, (393), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2022-10-15 17:49:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4642 transitions. [2022-10-15 17:49:49,653 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4642 transitions. Word has length 135 [2022-10-15 17:49:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:49,654 INFO L495 AbstractCegarLoop]: Abstraction has 3642 states and 4642 transitions. [2022-10-15 17:49:49,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-15 17:49:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4642 transitions. [2022-10-15 17:49:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-10-15 17:49:49,666 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:49,667 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:49,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:49,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:49,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash -607120538, now seen corresponding path program 1 times [2022-10-15 17:49:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:49,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357096957] [2022-10-15 17:49:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 17:49:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 17:49:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:49:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-15 17:49:50,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:50,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357096957] [2022-10-15 17:49:50,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357096957] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283620517] [2022-10-15 17:49:50,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:50,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:50,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:50,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:50,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 17:49:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 17:49:50,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-10-15 17:49:50,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:50,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283620517] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:50,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:50,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-10-15 17:49:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340665714] [2022-10-15 17:49:50,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:50,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:50,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:50,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:50,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:49:50,360 INFO L87 Difference]: Start difference. First operand 3642 states and 4642 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:50,502 INFO L93 Difference]: Finished difference Result 2712 states and 3368 transitions. [2022-10-15 17:49:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:49:50,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-10-15 17:49:50,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:50,519 INFO L225 Difference]: With dead ends: 2712 [2022-10-15 17:49:50,519 INFO L226 Difference]: Without dead ends: 2712 [2022-10-15 17:49:50,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:49:50,520 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 150 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:50,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 287 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2022-10-15 17:49:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2700. [2022-10-15 17:49:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2182 states have (on average 1.2396883593033914) internal successors, (2705), 2209 states have internal predecessors, (2705), 297 states have call successors, (297), 205 states have call predecessors, (297), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2022-10-15 17:49:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3356 transitions. [2022-10-15 17:49:50,615 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3356 transitions. Word has length 136 [2022-10-15 17:49:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:50,616 INFO L495 AbstractCegarLoop]: Abstraction has 2700 states and 3356 transitions. [2022-10-15 17:49:50,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3356 transitions. [2022-10-15 17:49:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-10-15 17:49:50,624 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:50,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:50,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:50,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:50,839 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1821138084, now seen corresponding path program 1 times [2022-10-15 17:49:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:50,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502262936] [2022-10-15 17:49:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:50,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 17:49:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 17:49:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:49:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-15 17:49:51,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:51,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502262936] [2022-10-15 17:49:51,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502262936] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:51,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037882524] [2022-10-15 17:49:51,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:51,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:51,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:51,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:51,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 17:49:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 17:49:51,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-10-15 17:49:51,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:51,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037882524] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:51,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:51,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-10-15 17:49:51,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25866534] [2022-10-15 17:49:51,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:51,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:51,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:51,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:49:51,257 INFO L87 Difference]: Start difference. First operand 2700 states and 3356 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:51,478 INFO L93 Difference]: Finished difference Result 2648 states and 3172 transitions. [2022-10-15 17:49:51,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:49:51,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-10-15 17:49:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:51,506 INFO L225 Difference]: With dead ends: 2648 [2022-10-15 17:49:51,507 INFO L226 Difference]: Without dead ends: 2648 [2022-10-15 17:49:51,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:49:51,508 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 171 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:51,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 294 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:49:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2022-10-15 17:49:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1674. [2022-10-15 17:49:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1368 states have (on average 1.192251461988304) internal successors, (1631), 1383 states have internal predecessors, (1631), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2022-10-15 17:49:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2009 transitions. [2022-10-15 17:49:51,596 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2009 transitions. Word has length 136 [2022-10-15 17:49:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:51,597 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2009 transitions. [2022-10-15 17:49:51,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2009 transitions. [2022-10-15 17:49:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-10-15 17:49:51,603 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:51,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:51,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:51,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-15 17:49:51,818 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:51,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash 513995686, now seen corresponding path program 1 times [2022-10-15 17:49:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:51,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196374575] [2022-10-15 17:49:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:51,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 17:49:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 17:49:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:49:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-15 17:49:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:52,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196374575] [2022-10-15 17:49:52,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196374575] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:52,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572001394] [2022-10-15 17:49:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:52,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:52,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:52,058 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:49:52,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 17:49:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 17:49:52,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-10-15 17:49:52,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:52,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572001394] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:52,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:52,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-15 17:49:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164501717] [2022-10-15 17:49:52,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:52,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:52,235 INFO L87 Difference]: Start difference. First operand 1674 states and 2009 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:52,285 INFO L93 Difference]: Finished difference Result 1541 states and 1790 transitions. [2022-10-15 17:49:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:49:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-10-15 17:49:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:52,303 INFO L225 Difference]: With dead ends: 1541 [2022-10-15 17:49:52,304 INFO L226 Difference]: Without dead ends: 1149 [2022-10-15 17:49:52,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:52,305 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:52,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2022-10-15 17:49:52,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1113. [2022-10-15 17:49:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 914 states have (on average 1.163019693654267) internal successors, (1063), 925 states have internal predecessors, (1063), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-10-15 17:49:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1296 transitions. [2022-10-15 17:49:52,343 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1296 transitions. Word has length 136 [2022-10-15 17:49:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:52,344 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1296 transitions. [2022-10-15 17:49:52,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1296 transitions. [2022-10-15 17:49:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-10-15 17:49:52,348 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:52,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:52,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:52,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-15 17:49:52,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash -792909398, now seen corresponding path program 1 times [2022-10-15 17:49:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:52,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504447988] [2022-10-15 17:49:52,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:52,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 17:49:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 17:49:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:49:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-15 17:49:52,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:52,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504447988] [2022-10-15 17:49:52,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504447988] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:49:52,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913842309] [2022-10-15 17:49:52,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:52,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:49:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:49:52,793 INFO L229 MonitoredProcess]: Starting monitored process 11 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:49:52,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 17:49:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:52,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 17:49:52,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:49:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-10-15 17:49:52,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:49:52,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913842309] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:52,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:49:52,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-15 17:49:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60840899] [2022-10-15 17:49:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:52,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:52,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:52,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:52,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:49:52,982 INFO L87 Difference]: Start difference. First operand 1113 states and 1296 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:53,026 INFO L93 Difference]: Finished difference Result 1141 states and 1303 transitions. [2022-10-15 17:49:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:49:53,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-10-15 17:49:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:53,032 INFO L225 Difference]: With dead ends: 1141 [2022-10-15 17:49:53,032 INFO L226 Difference]: Without dead ends: 1141 [2022-10-15 17:49:53,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:49:53,036 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 10 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:53,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 571 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:49:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-10-15 17:49:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1125. [2022-10-15 17:49:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 926 states have (on average 1.1382289416846652) internal successors, (1054), 937 states have internal predecessors, (1054), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-10-15 17:49:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1287 transitions. [2022-10-15 17:49:53,073 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1287 transitions. Word has length 136 [2022-10-15 17:49:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:53,074 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1287 transitions. [2022-10-15 17:49:53,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1287 transitions. [2022-10-15 17:49:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-10-15 17:49:53,078 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:53,078 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:53,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 17:49:53,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 17:49:53,294 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1500746030, now seen corresponding path program 1 times [2022-10-15 17:49:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:53,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308887863] [2022-10-15 17:49:53,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 17:49:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 17:49:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:49:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-10-15 17:49:53,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:53,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308887863] [2022-10-15 17:49:53,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308887863] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:53,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:53,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:49:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903424435] [2022-10-15 17:49:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:53,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:49:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:53,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:49:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:49:53,590 INFO L87 Difference]: Start difference. First operand 1125 states and 1287 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-10-15 17:49:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:54,163 INFO L93 Difference]: Finished difference Result 2082 states and 2357 transitions. [2022-10-15 17:49:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:49:54,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2022-10-15 17:49:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:54,172 INFO L225 Difference]: With dead ends: 2082 [2022-10-15 17:49:54,173 INFO L226 Difference]: Without dead ends: 2082 [2022-10-15 17:49:54,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-10-15 17:49:54,174 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 486 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:54,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 514 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 17:49:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-10-15 17:49:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1501. [2022-10-15 17:49:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1236 states have (on average 1.1375404530744337) internal successors, (1406), 1251 states have internal predecessors, (1406), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-10-15 17:49:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1715 transitions. [2022-10-15 17:49:54,231 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1715 transitions. Word has length 136 [2022-10-15 17:49:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:54,231 INFO L495 AbstractCegarLoop]: Abstraction has 1501 states and 1715 transitions. [2022-10-15 17:49:54,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-10-15 17:49:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1715 transitions. [2022-10-15 17:49:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-10-15 17:49:54,235 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:54,236 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:54,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 17:49:54,236 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash -479683818, now seen corresponding path program 1 times [2022-10-15 17:49:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:54,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517251593] [2022-10-15 17:49:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:54,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:49:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:49:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 17:49:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 17:49:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-15 17:49:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-15 17:49:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:49:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-15 17:49:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:49:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:49:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:49:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-10-15 17:49:54,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:49:54,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517251593] [2022-10-15 17:49:54,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517251593] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:49:54,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:49:54,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:49:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770759363] [2022-10-15 17:49:54,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:49:54,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:49:54,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:49:54,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:49:54,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:49:54,380 INFO L87 Difference]: Start difference. First operand 1501 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:49:54,653 INFO L93 Difference]: Finished difference Result 1864 states and 2210 transitions. [2022-10-15 17:49:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:49:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 140 [2022-10-15 17:49:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:49:54,663 INFO L225 Difference]: With dead ends: 1864 [2022-10-15 17:49:54,663 INFO L226 Difference]: Without dead ends: 1864 [2022-10-15 17:49:54,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:49:54,665 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 142 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:49:54,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 467 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:49:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-10-15 17:49:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1503. [2022-10-15 17:49:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1238 states have (on average 1.137318255250404) internal successors, (1408), 1253 states have internal predecessors, (1408), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-10-15 17:49:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1717 transitions. [2022-10-15 17:49:54,735 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1717 transitions. Word has length 140 [2022-10-15 17:49:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:49:54,736 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1717 transitions. [2022-10-15 17:49:54,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:49:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1717 transitions. [2022-10-15 17:49:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-10-15 17:49:54,740 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:49:54,740 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:54,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 17:49:54,741 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:49:54,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:49:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash -756063548, now seen corresponding path program 1 times [2022-10-15 17:49:54,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:49:54,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779531349] [2022-10-15 17:49:54,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:49:54,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:49:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:49:54,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:49:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:49:54,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:49:54,842 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:49:54,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:49:54,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:49:54,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 17:49:54,851 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:49:54,857 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:49:55,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:49:55 BoogieIcfgContainer [2022-10-15 17:49:55,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:49:55,032 INFO L158 Benchmark]: Toolchain (without parser) took 19828.69ms. Allocated memory was 154.1MB in the beginning and 284.2MB in the end (delta: 130.0MB). Free memory was 128.3MB in the beginning and 226.9MB in the end (delta: -98.7MB). Peak memory consumption was 32.4MB. Max. memory is 8.0GB. [2022-10-15 17:49:55,032 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 154.1MB. Free memory was 124.4MB in the beginning and 124.4MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:49:55,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.16ms. Allocated memory is still 154.1MB. Free memory was 128.0MB in the beginning and 115.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 17:49:55,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.76ms. Allocated memory is still 154.1MB. Free memory was 115.4MB in the beginning and 113.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:49:55,033 INFO L158 Benchmark]: Boogie Preprocessor took 49.14ms. Allocated memory is still 154.1MB. Free memory was 113.3MB in the beginning and 111.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:49:55,034 INFO L158 Benchmark]: RCFGBuilder took 1013.43ms. Allocated memory is still 154.1MB. Free memory was 111.6MB in the beginning and 127.3MB in the end (delta: -15.6MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-10-15 17:49:55,034 INFO L158 Benchmark]: TraceAbstraction took 18207.45ms. Allocated memory was 154.1MB in the beginning and 284.2MB in the end (delta: 130.0MB). Free memory was 126.7MB in the beginning and 226.9MB in the end (delta: -100.2MB). Peak memory consumption was 29.8MB. Max. memory is 8.0GB. [2022-10-15 17:49:55,040 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.27ms. Allocated memory is still 154.1MB. Free memory was 124.4MB in the beginning and 124.4MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 480.16ms. Allocated memory is still 154.1MB. Free memory was 128.0MB in the beginning and 115.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.76ms. Allocated memory is still 154.1MB. Free memory was 115.4MB in the beginning and 113.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.14ms. Allocated memory is still 154.1MB. Free memory was 113.3MB in the beginning and 111.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1013.43ms. Allocated memory is still 154.1MB. Free memory was 111.6MB in the beginning and 127.3MB in the end (delta: -15.6MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * TraceAbstraction took 18207.45ms. Allocated memory was 154.1MB in the beginning and 284.2MB in the end (delta: 130.0MB). Free memory was 126.7MB in the beginning and 226.9MB in the end (delta: -100.2MB). Peak memory consumption was 29.8MB. Max. memory is 8.0GB. * 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: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 VAL [E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L61] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L353] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L167] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L353] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L119] token += 1 [L120] E_M = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L121] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L353] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L136] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L137] COND TRUE E_M == 1 [L138] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND TRUE \read(tmp) [L332] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L156] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L165] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L167] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L353] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L121] RET immediate_notify() VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L122] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L197] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [__retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L213] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L47] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L69] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L74] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L75] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L82] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L83] CALL error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L20] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 484]: 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 8 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3350 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3239 mSDsluCounter, 8093 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4740 mSDsCounter, 543 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3741 IncrementalHoareTripleChecker+Invalid, 4284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 543 mSolverCounterUnsat, 3353 mSDtfsCounter, 3741 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1727 GetRequests, 1576 SyntacticMatches, 4 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4514occurred in iteration=9, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 3082 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 3215 NumberOfCodeBlocks, 3215 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3047 ConstructedInterpolants, 0 QuantifiedInterpolants, 4919 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3946 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 1377/1558 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:49:55,098 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...