/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/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:51:26,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:51:26,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:51:26,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:51:26,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:51:26,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:51:26,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:51:26,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:51:26,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:51:26,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:51:26,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:51:26,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:51:26,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:51:26,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:51:26,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:51:26,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:51:26,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:51:26,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:51:26,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:51:26,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:51:26,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:51:26,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:51:26,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:51:26,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:51:26,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:51:26,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:51:26,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:51:26,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:51:26,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:51:26,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:51:26,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:51:26,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:51:26,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:51:26,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:51:26,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:51:26,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:51:26,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:51:26,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:51:26,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:51:26,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:51:26,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:51:26,848 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:51:26,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:51:26,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:51:26,905 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:51:26,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:51:26,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:51:26,906 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:51:26,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:51:26,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:51:26,909 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:51:26,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:51:26,911 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:51:26,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:51:26,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:51:26,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:51:26,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:51:26,912 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:51:26,913 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:51:26,914 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:51:26,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:51:26,914 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:51:26,915 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:51:26,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:51:26,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:51:26,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:51:26,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:51:26,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:51:26,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:51:26,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:51:26,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:51:26,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:51:26,917 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:51:27,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:51:27,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:51:27,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:51:27,335 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:51:27,335 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:51:27,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-10-15 17:51:27,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7000fbc1e/933ffc5845d8416c90688e9324d78ef1/FLAGb49ef3b26 [2022-10-15 17:51:27,983 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:51:27,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-10-15 17:51:27,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7000fbc1e/933ffc5845d8416c90688e9324d78ef1/FLAGb49ef3b26 [2022-10-15 17:51:28,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7000fbc1e/933ffc5845d8416c90688e9324d78ef1 [2022-10-15 17:51:28,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:51:28,335 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:51:28,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:51:28,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:51:28,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:51:28,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5798d48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28, skipping insertion in model container [2022-10-15 17:51:28,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:51:28,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:51:28,534 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/transmitter.02.cil.c[706,719] [2022-10-15 17:51:28,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:51:28,614 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:51:28,629 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/transmitter.02.cil.c[706,719] [2022-10-15 17:51:28,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:51:28,702 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:51:28,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28 WrapperNode [2022-10-15 17:51:28,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:51:28,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:51:28,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:51:28,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:51:28,720 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:51:28" (1/1) ... [2022-10-15 17:51:28,740 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:51:28" (1/1) ... [2022-10-15 17:51:28,774 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2022-10-15 17:51:28,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:51:28,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:51:28,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:51:28,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:51:28,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,811 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:51:28,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:51:28,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:51:28,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:51:28,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (1/1) ... [2022-10-15 17:51:28,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:51:28,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:28,860 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:51:28,882 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:51:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:51:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-15 17:51:28,930 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-15 17:51:28,930 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-15 17:51:28,931 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-15 17:51:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-10-15 17:51:28,931 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-10-15 17:51:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-15 17:51:28,931 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-15 17:51:28,931 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-15 17:51:28,932 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-15 17:51:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:51:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-15 17:51:28,932 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-15 17:51:28,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:51:28,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:51:29,025 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:51:29,028 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:51:29,582 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:51:29,601 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:51:29,601 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-15 17:51:29,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:51:29 BoogieIcfgContainer [2022-10-15 17:51:29,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:51:29,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:51:29,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:51:29,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:51:29,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:51:28" (1/3) ... [2022-10-15 17:51:29,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4e3a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:51:29, skipping insertion in model container [2022-10-15 17:51:29,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:51:28" (2/3) ... [2022-10-15 17:51:29,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4e3a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:51:29, skipping insertion in model container [2022-10-15 17:51:29,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:51:29" (3/3) ... [2022-10-15 17:51:29,619 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2022-10-15 17:51:29,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:51:29,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:51:29,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:51:29,755 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;@68c2d48b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:51:29,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:51:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 108 states have internal predecessors, (165), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-10-15 17:51:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 17:51:29,792 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:29,794 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] [2022-10-15 17:51:29,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1318041689, now seen corresponding path program 1 times [2022-10-15 17:51:29,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:29,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764822903] [2022-10-15 17:51:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:30,241 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:51:30,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:30,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764822903] [2022-10-15 17:51:30,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764822903] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:30,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:30,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:51:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285692477] [2022-10-15 17:51:30,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:30,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:51:30,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:51:30,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:51:30,345 INFO L87 Difference]: Start difference. First operand has 129 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 108 states have internal predecessors, (165), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:51:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:30,960 INFO L93 Difference]: Finished difference Result 158 states and 230 transitions. [2022-10-15 17:51:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:51:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2022-10-15 17:51:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:30,978 INFO L225 Difference]: With dead ends: 158 [2022-10-15 17:51:30,979 INFO L226 Difference]: Without dead ends: 156 [2022-10-15 17:51:30,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:51:30,986 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 269 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:30,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 328 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 17:51:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-10-15 17:51:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2022-10-15 17:51:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 105 states have internal predecessors, (148), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-10-15 17:51:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2022-10-15 17:51:31,057 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 51 [2022-10-15 17:51:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:31,058 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2022-10-15 17:51:31,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:51:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2022-10-15 17:51:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 17:51:31,062 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:31,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:31,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:51:31,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:31,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash 907309687, now seen corresponding path program 1 times [2022-10-15 17:51:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:31,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54892101] [2022-10-15 17:51:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:31,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:31,617 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:51:31,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:31,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54892101] [2022-10-15 17:51:31,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54892101] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:31,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:31,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:51:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279612503] [2022-10-15 17:51:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:31,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:51:31,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:51:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:31,632 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:32,499 INFO L93 Difference]: Finished difference Result 299 states and 430 transitions. [2022-10-15 17:51:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:51:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-15 17:51:32,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:32,504 INFO L225 Difference]: With dead ends: 299 [2022-10-15 17:51:32,504 INFO L226 Difference]: Without dead ends: 299 [2022-10-15 17:51:32,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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:51:32,507 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 380 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:32,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 528 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 17:51:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-10-15 17:51:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 236. [2022-10-15 17:51:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 199 states have internal predecessors, (284), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-10-15 17:51:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 337 transitions. [2022-10-15 17:51:32,544 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 337 transitions. Word has length 67 [2022-10-15 17:51:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:32,544 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 337 transitions. [2022-10-15 17:51:32,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 337 transitions. [2022-10-15 17:51:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 17:51:32,548 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:32,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:32,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:51:32,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1048129942, now seen corresponding path program 1 times [2022-10-15 17:51:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:32,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971367803] [2022-10-15 17:51:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:32,800 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:51:32,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:32,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971367803] [2022-10-15 17:51:32,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971367803] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:32,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:32,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65025894] [2022-10-15 17:51:32,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:32,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:32,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:32,804 INFO L87 Difference]: Start difference. First operand 236 states and 337 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:33,270 INFO L93 Difference]: Finished difference Result 296 states and 429 transitions. [2022-10-15 17:51:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:51:33,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-15 17:51:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:33,274 INFO L225 Difference]: With dead ends: 296 [2022-10-15 17:51:33,274 INFO L226 Difference]: Without dead ends: 296 [2022-10-15 17:51:33,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:51:33,277 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 282 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:33,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 461 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 17:51:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-10-15 17:51:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 236. [2022-10-15 17:51:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.4387755102040816) internal successors, (282), 199 states have internal predecessors, (282), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-10-15 17:51:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 335 transitions. [2022-10-15 17:51:33,303 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 335 transitions. Word has length 67 [2022-10-15 17:51:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:33,303 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 335 transitions. [2022-10-15 17:51:33,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 335 transitions. [2022-10-15 17:51:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 17:51:33,307 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:33,307 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:33,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:51:33,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1924148948, now seen corresponding path program 1 times [2022-10-15 17:51:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:33,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282650390] [2022-10-15 17:51:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:33,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:33,510 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:51:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:33,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282650390] [2022-10-15 17:51:33,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282650390] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:33,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:33,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73873806] [2022-10-15 17:51:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:33,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:33,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:33,515 INFO L87 Difference]: Start difference. First operand 236 states and 335 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:34,484 INFO L93 Difference]: Finished difference Result 472 states and 673 transitions. [2022-10-15 17:51:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:51:34,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-15 17:51:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:34,489 INFO L225 Difference]: With dead ends: 472 [2022-10-15 17:51:34,489 INFO L226 Difference]: Without dead ends: 472 [2022-10-15 17:51:34,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-10-15 17:51:34,492 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 387 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:34,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 920 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 17:51:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-10-15 17:51:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 340. [2022-10-15 17:51:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 283 states have (on average 1.431095406360424) internal successors, (405), 287 states have internal predecessors, (405), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-10-15 17:51:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 480 transitions. [2022-10-15 17:51:34,522 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 480 transitions. Word has length 67 [2022-10-15 17:51:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:34,522 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 480 transitions. [2022-10-15 17:51:34,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 480 transitions. [2022-10-15 17:51:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 17:51:34,530 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:34,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:34,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:51:34,531 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1926917674, now seen corresponding path program 1 times [2022-10-15 17:51:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:34,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890031115] [2022-10-15 17:51:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:34,714 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:51:34,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:34,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890031115] [2022-10-15 17:51:34,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890031115] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:34,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:34,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363011323] [2022-10-15 17:51:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:34,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:34,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:34,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:34,718 INFO L87 Difference]: Start difference. First operand 340 states and 480 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:35,735 INFO L93 Difference]: Finished difference Result 753 states and 1064 transitions. [2022-10-15 17:51:35,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 17:51:35,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-15 17:51:35,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:35,743 INFO L225 Difference]: With dead ends: 753 [2022-10-15 17:51:35,743 INFO L226 Difference]: Without dead ends: 753 [2022-10-15 17:51:35,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-10-15 17:51:35,745 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 399 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:35,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 887 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 17:51:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-10-15 17:51:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 547. [2022-10-15 17:51:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 458 states have (on average 1.4323144104803494) internal successors, (656), 464 states have internal predecessors, (656), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-10-15 17:51:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 775 transitions. [2022-10-15 17:51:35,781 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 775 transitions. Word has length 67 [2022-10-15 17:51:35,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:35,782 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 775 transitions. [2022-10-15 17:51:35,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 775 transitions. [2022-10-15 17:51:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 17:51:35,786 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:35,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:35,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:51:35,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash 339463512, now seen corresponding path program 1 times [2022-10-15 17:51:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:35,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659669239] [2022-10-15 17:51:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:35,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:35,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:35,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:35,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:35,998 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:51:35,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659669239] [2022-10-15 17:51:35,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659669239] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:35,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:35,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:36,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703620233] [2022-10-15 17:51:36,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:36,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:36,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:36,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:36,003 INFO L87 Difference]: Start difference. First operand 547 states and 775 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:36,671 INFO L93 Difference]: Finished difference Result 673 states and 957 transitions. [2022-10-15 17:51:36,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:51:36,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-15 17:51:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:36,678 INFO L225 Difference]: With dead ends: 673 [2022-10-15 17:51:36,679 INFO L226 Difference]: Without dead ends: 673 [2022-10-15 17:51:36,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:51:36,682 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 254 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:36,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 598 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 17:51:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-10-15 17:51:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 550. [2022-10-15 17:51:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 461 states have (on average 1.420824295010846) internal successors, (655), 467 states have internal predecessors, (655), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-10-15 17:51:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 774 transitions. [2022-10-15 17:51:36,727 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 774 transitions. Word has length 67 [2022-10-15 17:51:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:36,728 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 774 transitions. [2022-10-15 17:51:36,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 774 transitions. [2022-10-15 17:51:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 17:51:36,733 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:36,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:36,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:51:36,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 587610006, now seen corresponding path program 1 times [2022-10-15 17:51:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:36,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697870807] [2022-10-15 17:51:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:36,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:36,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:36,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:36,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:36,919 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:51:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:36,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697870807] [2022-10-15 17:51:36,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697870807] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:36,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:36,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473924712] [2022-10-15 17:51:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:36,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:36,934 INFO L87 Difference]: Start difference. First operand 550 states and 774 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:37,598 INFO L93 Difference]: Finished difference Result 736 states and 1044 transitions. [2022-10-15 17:51:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:51:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-15 17:51:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:37,605 INFO L225 Difference]: With dead ends: 736 [2022-10-15 17:51:37,606 INFO L226 Difference]: Without dead ends: 736 [2022-10-15 17:51:37,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:51:37,608 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 254 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:37,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 587 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 17:51:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-10-15 17:51:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 565. [2022-10-15 17:51:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 476 states have (on average 1.4075630252100841) internal successors, (670), 482 states have internal predecessors, (670), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-10-15 17:51:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 789 transitions. [2022-10-15 17:51:37,648 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 789 transitions. Word has length 67 [2022-10-15 17:51:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:37,649 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 789 transitions. [2022-10-15 17:51:37,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 789 transitions. [2022-10-15 17:51:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 17:51:37,652 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:37,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:37,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:51:37,653 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash 193243220, now seen corresponding path program 1 times [2022-10-15 17:51:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:37,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845994535] [2022-10-15 17:51:37,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:37,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:37,823 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:51:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:37,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845994535] [2022-10-15 17:51:37,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845994535] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:37,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:37,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348584970] [2022-10-15 17:51:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:37,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:37,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:37,827 INFO L87 Difference]: Start difference. First operand 565 states and 789 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:39,154 INFO L93 Difference]: Finished difference Result 2457 states and 3483 transitions. [2022-10-15 17:51:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 17:51:39,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-10-15 17:51:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:39,171 INFO L225 Difference]: With dead ends: 2457 [2022-10-15 17:51:39,172 INFO L226 Difference]: Without dead ends: 2457 [2022-10-15 17:51:39,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-10-15 17:51:39,173 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 1020 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:39,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 890 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-15 17:51:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2022-10-15 17:51:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 1562. [2022-10-15 17:51:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1316 states have (on average 1.4095744680851063) internal successors, (1855), 1335 states have internal predecessors, (1855), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-10-15 17:51:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2188 transitions. [2022-10-15 17:51:39,250 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2188 transitions. Word has length 67 [2022-10-15 17:51:39,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:39,251 INFO L495 AbstractCegarLoop]: Abstraction has 1562 states and 2188 transitions. [2022-10-15 17:51:39,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2188 transitions. [2022-10-15 17:51:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-15 17:51:39,254 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:39,255 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 17:51:39,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:51:39,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -206950093, now seen corresponding path program 1 times [2022-10-15 17:51:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:39,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598406646] [2022-10-15 17:51:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:39,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:39,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:51:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 17:51:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:39,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598406646] [2022-10-15 17:51:39,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598406646] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:39,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:39,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482269483] [2022-10-15 17:51:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:39,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:39,393 INFO L87 Difference]: Start difference. First operand 1562 states and 2188 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:39,976 INFO L93 Difference]: Finished difference Result 1929 states and 2713 transitions. [2022-10-15 17:51:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:51:39,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-10-15 17:51:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:39,990 INFO L225 Difference]: With dead ends: 1929 [2022-10-15 17:51:39,990 INFO L226 Difference]: Without dead ends: 1929 [2022-10-15 17:51:39,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:51:39,991 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 171 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:39,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 587 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 17:51:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2022-10-15 17:51:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1592. [2022-10-15 17:51:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1346 states have (on average 1.3967310549777117) internal successors, (1880), 1365 states have internal predecessors, (1880), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-10-15 17:51:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2213 transitions. [2022-10-15 17:51:40,059 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2213 transitions. Word has length 84 [2022-10-15 17:51:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:40,059 INFO L495 AbstractCegarLoop]: Abstraction has 1592 states and 2213 transitions. [2022-10-15 17:51:40,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2213 transitions. [2022-10-15 17:51:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-15 17:51:40,062 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:40,063 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 17:51:40,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:51:40,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash -560038475, now seen corresponding path program 1 times [2022-10-15 17:51:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:40,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812138299] [2022-10-15 17:51:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:51:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 17:51:40,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:40,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812138299] [2022-10-15 17:51:40,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812138299] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:40,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:40,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:40,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351117152] [2022-10-15 17:51:40,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:40,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:40,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:40,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:40,255 INFO L87 Difference]: Start difference. First operand 1592 states and 2213 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:40,565 INFO L93 Difference]: Finished difference Result 1848 states and 2530 transitions. [2022-10-15 17:51:40,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:51:40,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-10-15 17:51:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:40,578 INFO L225 Difference]: With dead ends: 1848 [2022-10-15 17:51:40,579 INFO L226 Difference]: Without dead ends: 1848 [2022-10-15 17:51:40,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:51:40,580 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 395 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:40,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 362 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:51:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2022-10-15 17:51:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1580. [2022-10-15 17:51:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1334 states have (on average 1.3733133433283358) internal successors, (1832), 1353 states have internal predecessors, (1832), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-10-15 17:51:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2165 transitions. [2022-10-15 17:51:40,640 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2165 transitions. Word has length 84 [2022-10-15 17:51:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:40,640 INFO L495 AbstractCegarLoop]: Abstraction has 1580 states and 2165 transitions. [2022-10-15 17:51:40,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2165 transitions. [2022-10-15 17:51:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-15 17:51:40,643 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:40,644 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 17:51:40,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:51:40,644 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash -311891981, now seen corresponding path program 1 times [2022-10-15 17:51:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:40,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606753763] [2022-10-15 17:51:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:51:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 17:51:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:40,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606753763] [2022-10-15 17:51:40,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606753763] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:40,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:40,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:51:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375488208] [2022-10-15 17:51:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:40,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:51:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:51:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:51:40,831 INFO L87 Difference]: Start difference. First operand 1580 states and 2165 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:41,770 INFO L93 Difference]: Finished difference Result 1603 states and 2176 transitions. [2022-10-15 17:51:41,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-15 17:51:41,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-10-15 17:51:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:41,783 INFO L225 Difference]: With dead ends: 1603 [2022-10-15 17:51:41,783 INFO L226 Difference]: Without dead ends: 1603 [2022-10-15 17:51:41,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-10-15 17:51:41,785 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 488 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:41,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 695 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 17:51:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2022-10-15 17:51:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1261. [2022-10-15 17:51:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1063 states have (on average 1.3603010348071496) internal successors, (1446), 1075 states have internal predecessors, (1446), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-10-15 17:51:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1705 transitions. [2022-10-15 17:51:41,843 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1705 transitions. Word has length 84 [2022-10-15 17:51:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:41,844 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1705 transitions. [2022-10-15 17:51:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1705 transitions. [2022-10-15 17:51:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-15 17:51:41,846 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:41,846 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 17:51:41,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:51:41,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:41,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash 111754741, now seen corresponding path program 1 times [2022-10-15 17:51:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:41,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50109593] [2022-10-15 17:51:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:41,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:42,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:42,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:51:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 17:51:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:42,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50109593] [2022-10-15 17:51:42,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50109593] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:42,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:42,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:51:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602522057] [2022-10-15 17:51:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:42,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:51:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:42,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:51:42,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:51:42,036 INFO L87 Difference]: Start difference. First operand 1261 states and 1705 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:42,981 INFO L93 Difference]: Finished difference Result 1628 states and 2181 transitions. [2022-10-15 17:51:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 17:51:42,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-10-15 17:51:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:42,997 INFO L225 Difference]: With dead ends: 1628 [2022-10-15 17:51:42,997 INFO L226 Difference]: Without dead ends: 1628 [2022-10-15 17:51:42,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-10-15 17:51:42,999 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 489 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:42,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 702 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 17:51:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2022-10-15 17:51:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1249. [2022-10-15 17:51:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1054 states have (on average 1.3557874762808348) internal successors, (1429), 1063 states have internal predecessors, (1429), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-10-15 17:51:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1681 transitions. [2022-10-15 17:51:43,074 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1681 transitions. Word has length 84 [2022-10-15 17:51:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:43,074 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1681 transitions. [2022-10-15 17:51:43,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:51:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1681 transitions. [2022-10-15 17:51:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-15 17:51:43,076 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:43,077 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 17:51:43,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:51:43,077 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:43,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1733612425, now seen corresponding path program 1 times [2022-10-15 17:51:43,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:43,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732477662] [2022-10-15 17:51:43,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 17:51:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 17:51:43,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732477662] [2022-10-15 17:51:43,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732477662] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:51:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127310009] [2022-10-15 17:51:43,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:43,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:43,212 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:51:43,236 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:51:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:51:43,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:51:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:43,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:51:43,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127310009] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:43,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:51:43,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-15 17:51:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023939163] [2022-10-15 17:51:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:43,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:51:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:51:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:43,374 INFO L87 Difference]: Start difference. First operand 1249 states and 1681 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 17:51:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:43,420 INFO L93 Difference]: Finished difference Result 2045 states and 2774 transitions. [2022-10-15 17:51:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:51:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2022-10-15 17:51:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:43,436 INFO L225 Difference]: With dead ends: 2045 [2022-10-15 17:51:43,437 INFO L226 Difference]: Without dead ends: 2045 [2022-10-15 17:51:43,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:43,438 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 132 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:43,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 483 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:51:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2022-10-15 17:51:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2042. [2022-10-15 17:51:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1723 states have (on average 1.34648868253047) internal successors, (2320), 1734 states have internal predecessors, (2320), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-10-15 17:51:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2772 transitions. [2022-10-15 17:51:43,557 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2772 transitions. Word has length 84 [2022-10-15 17:51:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:43,558 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2772 transitions. [2022-10-15 17:51:43,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 17:51:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2772 transitions. [2022-10-15 17:51:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-10-15 17:51:43,563 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:43,564 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:43,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:51:43,764 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,SelfDestructingSolverStorable12 [2022-10-15 17:51:43,765 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1092771364, now seen corresponding path program 1 times [2022-10-15 17:51:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:43,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102245069] [2022-10-15 17:51:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:43,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:51:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 17:51:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:44,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102245069] [2022-10-15 17:51:44,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102245069] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:44,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:44,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:51:44,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140104707] [2022-10-15 17:51:44,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:44,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:51:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:51:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:44,151 INFO L87 Difference]: Start difference. First operand 2042 states and 2772 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-15 17:51:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:44,737 INFO L93 Difference]: Finished difference Result 4599 states and 6273 transitions. [2022-10-15 17:51:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:51:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-10-15 17:51:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:44,778 INFO L225 Difference]: With dead ends: 4599 [2022-10-15 17:51:44,778 INFO L226 Difference]: Without dead ends: 4599 [2022-10-15 17:51:44,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-10-15 17:51:44,779 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 617 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:44,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 522 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 17:51:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2022-10-15 17:51:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 4200. [2022-10-15 17:51:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4200 states, 3535 states have (on average 1.3213578500707213) internal successors, (4671), 3590 states have internal predecessors, (4671), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-10-15 17:51:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 5744 transitions. [2022-10-15 17:51:44,970 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 5744 transitions. Word has length 99 [2022-10-15 17:51:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:44,971 INFO L495 AbstractCegarLoop]: Abstraction has 4200 states and 5744 transitions. [2022-10-15 17:51:44,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-15 17:51:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 5744 transitions. [2022-10-15 17:51:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-10-15 17:51:44,974 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:44,975 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:44,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 17:51:44,975 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:44,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1261613918, now seen corresponding path program 1 times [2022-10-15 17:51:44,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:44,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246626645] [2022-10-15 17:51:44,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:51:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 17:51:45,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:45,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246626645] [2022-10-15 17:51:45,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246626645] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:45,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:45,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:51:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699573820] [2022-10-15 17:51:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:45,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:51:45,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:45,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:51:45,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:51:45,076 INFO L87 Difference]: Start difference. First operand 4200 states and 5744 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-15 17:51:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:45,400 INFO L93 Difference]: Finished difference Result 4765 states and 6499 transitions. [2022-10-15 17:51:45,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:51:45,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-10-15 17:51:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:45,436 INFO L225 Difference]: With dead ends: 4765 [2022-10-15 17:51:45,436 INFO L226 Difference]: Without dead ends: 4765 [2022-10-15 17:51:45,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:51:45,438 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 326 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:45,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 275 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:51:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4765 states. [2022-10-15 17:51:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4765 to 4195. [2022-10-15 17:51:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4195 states, 3533 states have (on average 1.3212567223322955) internal successors, (4668), 3587 states have internal predecessors, (4668), 363 states have call successors, (363), 230 states have call predecessors, (363), 297 states have return successors, (703), 378 states have call predecessors, (703), 363 states have call successors, (703) [2022-10-15 17:51:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 5734 transitions. [2022-10-15 17:51:45,634 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 5734 transitions. Word has length 99 [2022-10-15 17:51:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:45,634 INFO L495 AbstractCegarLoop]: Abstraction has 4195 states and 5734 transitions. [2022-10-15 17:51:45,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-15 17:51:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 5734 transitions. [2022-10-15 17:51:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-15 17:51:45,637 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:45,637 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:45,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 17:51:45,638 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:45,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:45,639 INFO L85 PathProgramCache]: Analyzing trace with hash 968343051, now seen corresponding path program 1 times [2022-10-15 17:51:45,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:45,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65342713] [2022-10-15 17:51:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:51:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 17:51:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:45,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65342713] [2022-10-15 17:51:45,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65342713] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:45,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:45,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:51:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123062784] [2022-10-15 17:51:45,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:45,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:51:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:51:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:51:45,760 INFO L87 Difference]: Start difference. First operand 4195 states and 5734 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 17:51:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:46,187 INFO L93 Difference]: Finished difference Result 6571 states and 8873 transitions. [2022-10-15 17:51:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:51:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2022-10-15 17:51:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:46,227 INFO L225 Difference]: With dead ends: 6571 [2022-10-15 17:51:46,227 INFO L226 Difference]: Without dead ends: 6571 [2022-10-15 17:51:46,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:51:46,228 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 420 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:46,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 364 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:51:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6571 states. [2022-10-15 17:51:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6571 to 5728. [2022-10-15 17:51:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5728 states, 4818 states have (on average 1.3169364881693648) internal successors, (6345), 4884 states have internal predecessors, (6345), 504 states have call successors, (504), 321 states have call predecessors, (504), 404 states have return successors, (923), 523 states have call predecessors, (923), 504 states have call successors, (923) [2022-10-15 17:51:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5728 states to 5728 states and 7772 transitions. [2022-10-15 17:51:46,502 INFO L78 Accepts]: Start accepts. Automaton has 5728 states and 7772 transitions. Word has length 100 [2022-10-15 17:51:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:46,503 INFO L495 AbstractCegarLoop]: Abstraction has 5728 states and 7772 transitions. [2022-10-15 17:51:46,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 17:51:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5728 states and 7772 transitions. [2022-10-15 17:51:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-10-15 17:51:46,511 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:46,512 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, 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:51:46,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 17:51:46,512 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2107731925, now seen corresponding path program 1 times [2022-10-15 17:51:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:46,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736435239] [2022-10-15 17:51:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-15 17:51:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 17:51:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 17:51:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736435239] [2022-10-15 17:51:46,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736435239] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:51:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335006202] [2022-10-15 17:51:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:46,681 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:51:46,689 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:51:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:46,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:51:46,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:51:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 17:51:46,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:51:46,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335006202] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:46,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:51:46,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-10-15 17:51:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93222017] [2022-10-15 17:51:46,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:46,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:51:46,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:46,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:51:46,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:46,906 INFO L87 Difference]: Start difference. First operand 5728 states and 7772 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 17:51:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:46,972 INFO L93 Difference]: Finished difference Result 7735 states and 10369 transitions. [2022-10-15 17:51:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:51:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-10-15 17:51:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:47,010 INFO L225 Difference]: With dead ends: 7735 [2022-10-15 17:51:47,011 INFO L226 Difference]: Without dead ends: 7721 [2022-10-15 17:51:47,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:47,012 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 89 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 377 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:51:47,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 377 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:51:47,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7721 states. [2022-10-15 17:51:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7721 to 7652. [2022-10-15 17:51:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7652 states, 6432 states have (on average 1.3140547263681592) internal successors, (8452), 6513 states have internal predecessors, (8452), 682 states have call successors, (682), 438 states have call predecessors, (682), 536 states have return successors, (1154), 701 states have call predecessors, (1154), 682 states have call successors, (1154) [2022-10-15 17:51:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 10288 transitions. [2022-10-15 17:51:47,325 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 10288 transitions. Word has length 117 [2022-10-15 17:51:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:47,326 INFO L495 AbstractCegarLoop]: Abstraction has 7652 states and 10288 transitions. [2022-10-15 17:51:47,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 17:51:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 10288 transitions. [2022-10-15 17:51:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-10-15 17:51:47,334 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:47,334 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, 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:51:47,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-15 17:51:47,547 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,SelfDestructingSolverStorable16 [2022-10-15 17:51:47,547 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash 388722281, now seen corresponding path program 1 times [2022-10-15 17:51:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:47,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357741966] [2022-10-15 17:51:47,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:47,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-15 17:51:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-15 17:51:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 17:51:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:47,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357741966] [2022-10-15 17:51:47,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357741966] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:51:47,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976376641] [2022-10-15 17:51:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:47,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:47,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:47,707 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:51:47,725 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:51:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:47,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:51:47,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:51:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 17:51:47,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:51:47,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976376641] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:47,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:51:47,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-15 17:51:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19691728] [2022-10-15 17:51:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:47,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:51:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:47,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:51:47,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:47,883 INFO L87 Difference]: Start difference. First operand 7652 states and 10288 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 17:51:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:47,962 INFO L93 Difference]: Finished difference Result 9351 states and 12331 transitions. [2022-10-15 17:51:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:51:47,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2022-10-15 17:51:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:48,011 INFO L225 Difference]: With dead ends: 9351 [2022-10-15 17:51:48,011 INFO L226 Difference]: Without dead ends: 9351 [2022-10-15 17:51:48,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:48,013 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 124 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:48,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 224 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:51:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9351 states. [2022-10-15 17:51:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9351 to 9244. [2022-10-15 17:51:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9244 states, 7850 states have (on average 1.280891719745223) internal successors, (10055), 7947 states have internal predecessors, (10055), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2022-10-15 17:51:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9244 states to 9244 states and 12193 transitions. [2022-10-15 17:51:48,377 INFO L78 Accepts]: Start accepts. Automaton has 9244 states and 12193 transitions. Word has length 118 [2022-10-15 17:51:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:48,377 INFO L495 AbstractCegarLoop]: Abstraction has 9244 states and 12193 transitions. [2022-10-15 17:51:48,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 17:51:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 9244 states and 12193 transitions. [2022-10-15 17:51:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-10-15 17:51:48,382 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:48,382 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, 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] [2022-10-15 17:51:48,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:51:48,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 17:51:48,597 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash -967006389, now seen corresponding path program 1 times [2022-10-15 17:51:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:48,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084881581] [2022-10-15 17:51:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-15 17:51:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:51:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-15 17:51:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-15 17:51:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-15 17:51:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-15 17:51:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 17:51:48,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:48,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084881581] [2022-10-15 17:51:48,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084881581] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:51:48,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094856266] [2022-10-15 17:51:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:48,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:48,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:48,773 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:51:48,778 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:51:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:48,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:51:48,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:51:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-10-15 17:51:48,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:51:48,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094856266] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:48,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:51:48,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2022-10-15 17:51:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107710465] [2022-10-15 17:51:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:48,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:51:48,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:48,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:51:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:51:48,958 INFO L87 Difference]: Start difference. First operand 9244 states and 12193 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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:51:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:49,030 INFO L93 Difference]: Finished difference Result 9243 states and 12192 transitions. [2022-10-15 17:51:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:51:49,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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 123 [2022-10-15 17:51:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:49,075 INFO L225 Difference]: With dead ends: 9243 [2022-10-15 17:51:49,075 INFO L226 Difference]: Without dead ends: 9241 [2022-10-15 17:51:49,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:51:49,076 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 56 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:49,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 236 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:51:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9241 states. [2022-10-15 17:51:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9241 to 9241. [2022-10-15 17:51:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 7848 states have (on average 1.2719164118246686) internal successors, (9982), 7944 states have internal predecessors, (9982), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2022-10-15 17:51:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 12120 transitions. [2022-10-15 17:51:49,471 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 12120 transitions. Word has length 123 [2022-10-15 17:51:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:49,472 INFO L495 AbstractCegarLoop]: Abstraction has 9241 states and 12120 transitions. [2022-10-15 17:51:49,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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:51:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 12120 transitions. [2022-10-15 17:51:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-10-15 17:51:49,477 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:49,477 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, 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:51:49,518 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:51:49,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:49,692 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:49,693 INFO L85 PathProgramCache]: Analyzing trace with hash 384112850, now seen corresponding path program 1 times [2022-10-15 17:51:49,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:49,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237075165] [2022-10-15 17:51:49,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-15 17:51:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:51:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 17:51:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:49,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237075165] [2022-10-15 17:51:49,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237075165] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:51:49,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989686534] [2022-10-15 17:51:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:49,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:49,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:49,872 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:51:49,898 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:51:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:49,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 17:51:49,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:51:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:51:50,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:51:50,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989686534] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:50,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:51:50,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-15 17:51:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074586503] [2022-10-15 17:51:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:50,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:51:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:51:50,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:50,027 INFO L87 Difference]: Start difference. First operand 9241 states and 12120 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-15 17:51:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:50,092 INFO L93 Difference]: Finished difference Result 9930 states and 12753 transitions. [2022-10-15 17:51:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:51:50,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2022-10-15 17:51:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:50,133 INFO L225 Difference]: With dead ends: 9930 [2022-10-15 17:51:50,133 INFO L226 Difference]: Without dead ends: 9930 [2022-10-15 17:51:50,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:51:50,135 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:50,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:51:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2022-10-15 17:51:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 9843. [2022-10-15 17:51:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 8423 states have (on average 1.2614270449958447) internal successors, (10625), 8525 states have internal predecessors, (10625), 758 states have call successors, (758), 550 states have call predecessors, (758), 661 states have return successors, (1272), 768 states have call predecessors, (1272), 758 states have call successors, (1272) [2022-10-15 17:51:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12655 transitions. [2022-10-15 17:51:50,586 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12655 transitions. Word has length 121 [2022-10-15 17:51:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:50,586 INFO L495 AbstractCegarLoop]: Abstraction has 9843 states and 12655 transitions. [2022-10-15 17:51:50,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-15 17:51:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12655 transitions. [2022-10-15 17:51:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-10-15 17:51:50,594 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:50,594 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2022-10-15 17:51:50,641 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:51:50,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:50,807 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:50,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash 399632418, now seen corresponding path program 1 times [2022-10-15 17:51:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:50,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862420455] [2022-10-15 17:51:50,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-15 17:51:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-15 17:51:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-10-15 17:51:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:51,013 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 17:51:51,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:51,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862420455] [2022-10-15 17:51:51,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862420455] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:51:51,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578033052] [2022-10-15 17:51:51,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:51,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:51,015 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:51:51,022 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:51:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:51,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:51:51,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:51:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 17:51:51,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:51:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578033052] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:51,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:51:51,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-10-15 17:51:51,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953310605] [2022-10-15 17:51:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:51,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:51:51,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:51,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:51:51,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:51,161 INFO L87 Difference]: Start difference. First operand 9843 states and 12655 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-15 17:51:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:51,389 INFO L93 Difference]: Finished difference Result 18910 states and 24394 transitions. [2022-10-15 17:51:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:51:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 153 [2022-10-15 17:51:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:51,498 INFO L225 Difference]: With dead ends: 18910 [2022-10-15 17:51:51,498 INFO L226 Difference]: Without dead ends: 18910 [2022-10-15 17:51:51,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:51,499 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 147 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:51,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:51:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2022-10-15 17:51:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18895. [2022-10-15 17:51:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18895 states, 16195 states have (on average 1.250077184316147) internal successors, (20245), 16388 states have internal predecessors, (20245), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-10-15 17:51:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18895 states to 18895 states and 24374 transitions. [2022-10-15 17:51:52,602 INFO L78 Accepts]: Start accepts. Automaton has 18895 states and 24374 transitions. Word has length 153 [2022-10-15 17:51:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:52,603 INFO L495 AbstractCegarLoop]: Abstraction has 18895 states and 24374 transitions. [2022-10-15 17:51:52,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-15 17:51:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 18895 states and 24374 transitions. [2022-10-15 17:51:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-10-15 17:51:52,623 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:52,623 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2022-10-15 17:51:52,694 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:51:52,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:52,837 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1847588350, now seen corresponding path program 1 times [2022-10-15 17:51:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:52,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876078662] [2022-10-15 17:51:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 17:51:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:51:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-10-15 17:51:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-10-15 17:51:52,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:52,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876078662] [2022-10-15 17:51:52,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876078662] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:51:52,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223449959] [2022-10-15 17:51:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:52,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:52,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:52,996 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:51:53,008 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:51:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:53,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:51:53,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:51:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 17:51:53,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:51:53,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223449959] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:53,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:51:53,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-10-15 17:51:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915333489] [2022-10-15 17:51:53,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:53,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:51:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:51:53,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:53,182 INFO L87 Difference]: Start difference. First operand 18895 states and 24374 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-15 17:51:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:53,404 INFO L93 Difference]: Finished difference Result 18527 states and 23722 transitions. [2022-10-15 17:51:53,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:51:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 154 [2022-10-15 17:51:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:53,491 INFO L225 Difference]: With dead ends: 18527 [2022-10-15 17:51:53,491 INFO L226 Difference]: Without dead ends: 18527 [2022-10-15 17:51:53,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:53,492 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 118 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:53,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 461 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:51:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18527 states. [2022-10-15 17:51:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18527 to 18465. [2022-10-15 17:51:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 15765 states have (on average 1.238883602917856) internal successors, (19531), 15958 states have internal predecessors, (19531), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-10-15 17:51:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 23660 transitions. [2022-10-15 17:51:54,308 INFO L78 Accepts]: Start accepts. Automaton has 18465 states and 23660 transitions. Word has length 154 [2022-10-15 17:51:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:54,309 INFO L495 AbstractCegarLoop]: Abstraction has 18465 states and 23660 transitions. [2022-10-15 17:51:54,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-15 17:51:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18465 states and 23660 transitions. [2022-10-15 17:51:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-10-15 17:51:54,325 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:54,325 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2022-10-15 17:51:54,371 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:51:54,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:54,538 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1995946417, now seen corresponding path program 1 times [2022-10-15 17:51:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:54,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510727570] [2022-10-15 17:51:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 17:51:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:51:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:51:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-10-15 17:51:54,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:54,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510727570] [2022-10-15 17:51:54,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510727570] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:54,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:54,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:51:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772639569] [2022-10-15 17:51:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:54,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:51:54,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:54,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:51:54,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:54,679 INFO L87 Difference]: Start difference. First operand 18465 states and 23660 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-15 17:51:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:55,372 INFO L93 Difference]: Finished difference Result 17956 states and 22665 transitions. [2022-10-15 17:51:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:51:55,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 155 [2022-10-15 17:51:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:55,462 INFO L225 Difference]: With dead ends: 17956 [2022-10-15 17:51:55,463 INFO L226 Difference]: Without dead ends: 17956 [2022-10-15 17:51:55,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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:51:55,464 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 561 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:55,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 586 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 17:51:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17956 states. [2022-10-15 17:51:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17956 to 16098. [2022-10-15 17:51:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16098 states, 13792 states have (on average 1.2261455916473318) internal successors, (16911), 13972 states have internal predecessors, (16911), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-10-15 17:51:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16098 states to 16098 states and 20177 transitions. [2022-10-15 17:51:56,202 INFO L78 Accepts]: Start accepts. Automaton has 16098 states and 20177 transitions. Word has length 155 [2022-10-15 17:51:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:56,203 INFO L495 AbstractCegarLoop]: Abstraction has 16098 states and 20177 transitions. [2022-10-15 17:51:56,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-15 17:51:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 16098 states and 20177 transitions. [2022-10-15 17:51:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-10-15 17:51:56,219 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:56,220 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:56,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-15 17:51:56,220 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:56,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash -573974028, now seen corresponding path program 1 times [2022-10-15 17:51:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308215288] [2022-10-15 17:51:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 17:51:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:51:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:51:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 17:51:56,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:56,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308215288] [2022-10-15 17:51:56,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308215288] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:51:56,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112013503] [2022-10-15 17:51:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:56,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:51:56,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:51:56,405 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:51:56,416 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:51:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:56,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 17:51:56,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:51:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 17:51:56,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:51:56,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112013503] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:56,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:51:56,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-10-15 17:51:56,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221565734] [2022-10-15 17:51:56,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:56,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:51:56,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:56,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:51:56,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:56,620 INFO L87 Difference]: Start difference. First operand 16098 states and 20177 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-15 17:51:56,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:56,718 INFO L93 Difference]: Finished difference Result 16151 states and 19930 transitions. [2022-10-15 17:51:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:51:56,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 156 [2022-10-15 17:51:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:56,915 INFO L225 Difference]: With dead ends: 16151 [2022-10-15 17:51:56,915 INFO L226 Difference]: Without dead ends: 16151 [2022-10-15 17:51:56,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:51:56,916 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 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:51:56,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:51:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16151 states. [2022-10-15 17:51:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16151 to 16082. [2022-10-15 17:51:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16082 states, 13776 states have (on average 1.2047038327526132) internal successors, (16596), 13956 states have internal predecessors, (16596), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-10-15 17:51:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16082 states to 16082 states and 19862 transitions. [2022-10-15 17:51:57,445 INFO L78 Accepts]: Start accepts. Automaton has 16082 states and 19862 transitions. Word has length 156 [2022-10-15 17:51:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:51:57,445 INFO L495 AbstractCegarLoop]: Abstraction has 16082 states and 19862 transitions. [2022-10-15 17:51:57,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-15 17:51:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 16082 states and 19862 transitions. [2022-10-15 17:51:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-10-15 17:51:57,456 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:51:57,457 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1] [2022-10-15 17:51:57,499 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:51:57,672 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,SelfDestructingSolverStorable23 [2022-10-15 17:51:57,673 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:51:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:51:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1060928177, now seen corresponding path program 2 times [2022-10-15 17:51:57,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:51:57,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278051659] [2022-10-15 17:51:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:51:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:51:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:51:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 17:51:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-15 17:51:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 17:51:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:51:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-15 17:51:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-15 17:51:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-10-15 17:51:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-15 17:51:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:51:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-15 17:51:57,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:51:57,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278051659] [2022-10-15 17:51:57,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278051659] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:51:57,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:51:57,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:51:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895018845] [2022-10-15 17:51:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:51:57,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:51:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:51:57,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:51:57,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:51:57,890 INFO L87 Difference]: Start difference. First operand 16082 states and 19862 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-10-15 17:51:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:51:59,114 INFO L93 Difference]: Finished difference Result 24579 states and 29178 transitions. [2022-10-15 17:51:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-15 17:51:59,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 156 [2022-10-15 17:51:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:51:59,215 INFO L225 Difference]: With dead ends: 24579 [2022-10-15 17:51:59,215 INFO L226 Difference]: Without dead ends: 24579 [2022-10-15 17:51:59,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-10-15 17:51:59,217 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 912 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 17:51:59,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 504 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 17:51:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24579 states. [2022-10-15 17:51:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24579 to 23029. [2022-10-15 17:51:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23029 states, 19688 states have (on average 1.1473994311255586) internal successors, (22590), 20035 states have internal predecessors, (22590), 1643 states have call successors, (1643), 1326 states have call predecessors, (1643), 1697 states have return successors, (3030), 1669 states have call predecessors, (3030), 1643 states have call successors, (3030) [2022-10-15 17:52:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 27263 transitions. [2022-10-15 17:52:00,087 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 27263 transitions. Word has length 156 [2022-10-15 17:52:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:52:00,088 INFO L495 AbstractCegarLoop]: Abstraction has 23029 states and 27263 transitions. [2022-10-15 17:52:00,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-10-15 17:52:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 27263 transitions. [2022-10-15 17:52:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-10-15 17:52:00,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:52:00,103 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:52:00,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-15 17:52:00,104 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:52:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:52:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash -703829978, now seen corresponding path program 1 times [2022-10-15 17:52:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:52:00,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532179952] [2022-10-15 17:52:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:52:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:52:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:52:00,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:52:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:52:00,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:52:00,356 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:52:00,358 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:52:00,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:52:00,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-15 17:52:00,367 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:52:00,373 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:52:00,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:52:00 BoogieIcfgContainer [2022-10-15 17:52:00,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:52:00,600 INFO L158 Benchmark]: Toolchain (without parser) took 32271.14ms. Allocated memory was 158.3MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 131.1MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 524.3MB. Max. memory is 8.0GB. [2022-10-15 17:52:00,601 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 158.3MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:52:00,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.58ms. Allocated memory is still 158.3MB. Free memory was 130.9MB in the beginning and 117.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 17:52:00,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.54ms. Allocated memory is still 158.3MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:52:00,602 INFO L158 Benchmark]: Boogie Preprocessor took 41.29ms. Allocated memory is still 158.3MB. Free memory was 115.4MB in the beginning and 113.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:52:00,603 INFO L158 Benchmark]: RCFGBuilder took 788.72ms. Allocated memory is still 158.3MB. Free memory was 113.5MB in the beginning and 131.1MB in the end (delta: -17.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:52:00,605 INFO L158 Benchmark]: TraceAbstraction took 30987.91ms. Allocated memory was 158.3MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 130.6MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 523.3MB. Max. memory is 8.0GB. [2022-10-15 17:52:00,607 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.20ms. Allocated memory is still 158.3MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 368.58ms. Allocated memory is still 158.3MB. Free memory was 130.9MB in the beginning and 117.5MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.54ms. Allocated memory is still 158.3MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.29ms. Allocated memory is still 158.3MB. Free memory was 115.4MB in the beginning and 113.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 788.72ms. Allocated memory is still 158.3MB. Free memory was 113.5MB in the beginning and 131.1MB in the end (delta: -17.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 30987.91ms. Allocated memory was 158.3MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 130.6MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 523.3MB. 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: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, kernel_st=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - UnprovableResult [Line: 572]: 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 7 procedures, 129 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8691 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8501 mSDsluCounter, 12783 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7370 mSDsCounter, 1504 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8859 IncrementalHoareTripleChecker+Invalid, 10363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1504 mSolverCounterUnsat, 5413 mSDtfsCounter, 8859 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1699 GetRequests, 1442 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23029occurred in iteration=25, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 8638 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 3674 NumberOfCodeBlocks, 3674 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3484 ConstructedInterpolants, 0 QuantifiedInterpolants, 7078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3149 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 961/1092 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:52:00,680 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...