/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 04:21:47,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 04:21:47,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 04:21:47,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 04:21:47,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 04:21:47,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 04:21:47,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 04:21:47,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 04:21:47,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 04:21:47,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 04:21:47,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 04:21:47,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 04:21:47,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 04:21:47,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 04:21:47,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 04:21:47,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 04:21:47,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 04:21:47,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 04:21:47,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 04:21:47,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 04:21:47,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 04:21:47,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 04:21:47,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 04:21:47,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 04:21:47,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 04:21:47,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 04:21:47,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 04:21:47,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 04:21:47,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 04:21:47,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 04:21:47,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 04:21:47,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 04:21:47,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 04:21:47,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 04:21:47,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 04:21:47,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 04:21:47,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 04:21:47,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 04:21:47,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 04:21:47,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 04:21:47,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 04:21:47,222 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-16 04:21:47,251 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 04:21:47,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 04:21:47,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 04:21:47,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 04:21:47,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 04:21:47,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 04:21:47,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 04:21:47,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 04:21:47,255 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 04:21:47,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 04:21:47,256 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 04:21:47,256 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 04:21:47,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 04:21:47,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 04:21:47,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 04:21:47,257 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 04:21:47,257 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 04:21:47,258 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 04:21:47,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 04:21:47,258 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 04:21:47,259 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 04:21:47,259 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 04:21:47,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 04:21:47,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 04:21:47,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 04:21:47,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 04:21:47,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 04:21:47,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 04:21:47,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 04:21:47,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 04:21:47,261 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-16 04:21:47,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 04:21:47,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 04:21:47,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 04:21:47,691 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 04:21:47,691 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 04:21:47,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2022-10-16 04:21:47,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7deddfd3/fefa50d24c3b41c0aa68213cf84ee45d/FLAGb85fa5f89 [2022-10-16 04:21:48,509 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 04:21:48,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2022-10-16 04:21:48,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7deddfd3/fefa50d24c3b41c0aa68213cf84ee45d/FLAGb85fa5f89 [2022-10-16 04:21:48,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7deddfd3/fefa50d24c3b41c0aa68213cf84ee45d [2022-10-16 04:21:48,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 04:21:48,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 04:21:48,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 04:21:48,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 04:21:48,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 04:21:48,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:21:48" (1/1) ... [2022-10-16 04:21:48,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134bd8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:48, skipping insertion in model container [2022-10-16 04:21:48,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:21:48" (1/1) ... [2022-10-16 04:21:48,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 04:21:48,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 04:21:49,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[671,684] [2022-10-16 04:21:49,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 04:21:49,272 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 04:21:49,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[671,684] [2022-10-16 04:21:49,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 04:21:49,379 INFO L208 MainTranslator]: Completed translation [2022-10-16 04:21:49,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49 WrapperNode [2022-10-16 04:21:49,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 04:21:49,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 04:21:49,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 04:21:49,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 04:21:49,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,443 INFO L138 Inliner]: procedures = 34, calls = 41, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 336 [2022-10-16 04:21:49,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 04:21:49,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 04:21:49,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 04:21:49,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 04:21:49,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 04:21:49,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 04:21:49,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 04:21:49,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 04:21:49,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (1/1) ... [2022-10-16 04:21:49,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 04:21:49,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:21:49,549 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-16 04:21:49,575 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-16 04:21:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 04:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-10-16 04:21:49,621 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-10-16 04:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-16 04:21:49,621 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-16 04:21:49,621 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-16 04:21:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-16 04:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-10-16 04:21:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-10-16 04:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-16 04:21:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-16 04:21:49,622 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-16 04:21:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-16 04:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 04:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-16 04:21:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-16 04:21:49,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 04:21:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 04:21:49,714 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 04:21:49,717 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 04:21:50,409 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 04:21:50,423 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 04:21:50,423 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-16 04:21:50,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:21:50 BoogieIcfgContainer [2022-10-16 04:21:50,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 04:21:50,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 04:21:50,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 04:21:50,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 04:21:50,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:21:48" (1/3) ... [2022-10-16 04:21:50,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40799f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:21:50, skipping insertion in model container [2022-10-16 04:21:50,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:21:49" (2/3) ... [2022-10-16 04:21:50,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40799f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:21:50, skipping insertion in model container [2022-10-16 04:21:50,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:21:50" (3/3) ... [2022-10-16 04:21:50,441 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2022-10-16 04:21:50,466 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 04:21:50,467 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-16 04:21:50,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 04:21:50,583 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;@75da85d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 04:21:50,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-16 04:21:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 142 states have internal predecessors, (221), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-10-16 04:21:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-16 04:21:50,609 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:21:50,610 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] [2022-10-16 04:21:50,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:21:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:21:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1296355189, now seen corresponding path program 1 times [2022-10-16 04:21:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:21:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514225109] [2022-10-16 04:21:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:21:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:21:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:21:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:50,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:21:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:51,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:21:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:51,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:21:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:51,090 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-16 04:21:51,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:21:51,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514225109] [2022-10-16 04:21:51,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514225109] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:21:51,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:21:51,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 04:21:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389913969] [2022-10-16 04:21:51,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:21:51,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:21:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:21:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:21:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:21:51,143 INFO L87 Difference]: Start difference. First operand has 166 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 142 states have internal predecessors, (221), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 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-16 04:21:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:21:51,738 INFO L93 Difference]: Finished difference Result 207 states and 316 transitions. [2022-10-16 04:21:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:21:51,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 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 64 [2022-10-16 04:21:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:21:51,759 INFO L225 Difference]: With dead ends: 207 [2022-10-16 04:21:51,759 INFO L226 Difference]: Without dead ends: 205 [2022-10-16 04:21:51,762 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-16 04:21:51,767 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 372 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 04:21:51,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 442 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 04:21:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-10-16 04:21:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 162. [2022-10-16 04:21:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.511111111111111) internal successors, (204), 138 states have internal predecessors, (204), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-10-16 04:21:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2022-10-16 04:21:51,842 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 64 [2022-10-16 04:21:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:21:51,843 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2022-10-16 04:21:51,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 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-16 04:21:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2022-10-16 04:21:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 04:21:51,848 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:21:51,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:21:51,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 04:21:51,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:21:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:21:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1738560571, now seen corresponding path program 1 times [2022-10-16 04:21:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:21:51,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932906136] [2022-10-16 04:21:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:21:51,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:21:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:21:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:21:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:21:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:21:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:52,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:21:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:52,281 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-16 04:21:52,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:21:52,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932906136] [2022-10-16 04:21:52,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932906136] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:21:52,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:21:52,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 04:21:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852230506] [2022-10-16 04:21:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:21:52,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 04:21:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:21:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 04:21:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 04:21:52,286 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:21:53,401 INFO L93 Difference]: Finished difference Result 399 states and 607 transitions. [2022-10-16 04:21:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 04:21:53,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-10-16 04:21:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:21:53,412 INFO L225 Difference]: With dead ends: 399 [2022-10-16 04:21:53,412 INFO L226 Difference]: Without dead ends: 399 [2022-10-16 04:21:53,413 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-16 04:21:53,417 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 540 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 04:21:53,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 710 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 04:21:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-10-16 04:21:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 309. [2022-10-16 04:21:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 263 states have (on average 1.5285171102661597) internal successors, (402), 267 states have internal predecessors, (402), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-10-16 04:21:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 465 transitions. [2022-10-16 04:21:53,470 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 465 transitions. Word has length 79 [2022-10-16 04:21:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:21:53,471 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 465 transitions. [2022-10-16 04:21:53,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 465 transitions. [2022-10-16 04:21:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 04:21:53,475 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:21:53,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:21:53,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 04:21:53,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:21:53,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:21:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1314966209, now seen corresponding path program 1 times [2022-10-16 04:21:53,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:21:53,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445050672] [2022-10-16 04:21:53,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:21:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:21:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:53,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:21:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:53,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:21:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:53,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:21:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:53,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:21:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:53,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:21:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:53,845 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-16 04:21:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:21:53,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445050672] [2022-10-16 04:21:53,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445050672] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:21:53,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:21:53,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 04:21:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585960098] [2022-10-16 04:21:53,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:21:53,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 04:21:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:21:53,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 04:21:53,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:21:53,849 INFO L87 Difference]: Start difference. First operand 309 states and 465 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:21:54,997 INFO L93 Difference]: Finished difference Result 592 states and 904 transitions. [2022-10-16 04:21:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 04:21:54,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-10-16 04:21:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:21:55,012 INFO L225 Difference]: With dead ends: 592 [2022-10-16 04:21:55,012 INFO L226 Difference]: Without dead ends: 592 [2022-10-16 04:21:55,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-10-16 04:21:55,019 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 535 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 04:21:55,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1215 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 04:21:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-10-16 04:21:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 448. [2022-10-16 04:21:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 383 states have (on average 1.524804177545692) internal successors, (584), 388 states have internal predecessors, (584), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-10-16 04:21:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 673 transitions. [2022-10-16 04:21:55,068 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 673 transitions. Word has length 79 [2022-10-16 04:21:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:21:55,068 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 673 transitions. [2022-10-16 04:21:55,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 673 transitions. [2022-10-16 04:21:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 04:21:55,073 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:21:55,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:21:55,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 04:21:55,074 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:21:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:21:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1260573311, now seen corresponding path program 1 times [2022-10-16 04:21:55,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:21:55,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323257701] [2022-10-16 04:21:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:21:55,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:21:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:21:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:21:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:55,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:21:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:21:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:21:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:55,343 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-16 04:21:55,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:21:55,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323257701] [2022-10-16 04:21:55,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323257701] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:21:55,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:21:55,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 04:21:55,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378870930] [2022-10-16 04:21:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:21:55,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 04:21:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:21:55,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 04:21:55,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:21:55,350 INFO L87 Difference]: Start difference. First operand 448 states and 673 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:21:56,483 INFO L93 Difference]: Finished difference Result 951 states and 1451 transitions. [2022-10-16 04:21:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 04:21:56,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-10-16 04:21:56,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:21:56,492 INFO L225 Difference]: With dead ends: 951 [2022-10-16 04:21:56,492 INFO L226 Difference]: Without dead ends: 951 [2022-10-16 04:21:56,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-10-16 04:21:56,494 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 531 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 04:21:56,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1208 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 04:21:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-10-16 04:21:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 729. [2022-10-16 04:21:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 626 states have (on average 1.5223642172523961) internal successors, (953), 633 states have internal predecessors, (953), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-10-16 04:21:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1098 transitions. [2022-10-16 04:21:56,572 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1098 transitions. Word has length 79 [2022-10-16 04:21:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:21:56,573 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 1098 transitions. [2022-10-16 04:21:56,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1098 transitions. [2022-10-16 04:21:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 04:21:56,589 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:21:56,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:21:56,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 04:21:56,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:21:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:21:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash 843176705, now seen corresponding path program 1 times [2022-10-16 04:21:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:21:56,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448512716] [2022-10-16 04:21:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:21:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:21:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:21:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:56,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:21:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:21:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:56,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:21:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:21:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:56,797 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-16 04:21:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:21:56,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448512716] [2022-10-16 04:21:56,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448512716] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:21:56,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:21:56,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 04:21:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331458025] [2022-10-16 04:21:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:21:56,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 04:21:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:21:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 04:21:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:21:56,800 INFO L87 Difference]: Start difference. First operand 729 states and 1098 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:21:57,996 INFO L93 Difference]: Finished difference Result 1845 states and 2799 transitions. [2022-10-16 04:21:57,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 04:21:57,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-10-16 04:21:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:21:58,011 INFO L225 Difference]: With dead ends: 1845 [2022-10-16 04:21:58,011 INFO L226 Difference]: Without dead ends: 1845 [2022-10-16 04:21:58,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-16 04:21:58,013 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 665 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 04:21:58,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1193 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 04:21:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2022-10-16 04:21:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1282. [2022-10-16 04:21:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1107 states have (on average 1.5239385727190604) internal successors, (1687), 1118 states have internal predecessors, (1687), 111 states have call successors, (111), 55 states have call predecessors, (111), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2022-10-16 04:21:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1942 transitions. [2022-10-16 04:21:58,132 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1942 transitions. Word has length 79 [2022-10-16 04:21:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:21:58,134 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1942 transitions. [2022-10-16 04:21:58,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1942 transitions. [2022-10-16 04:21:58,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 04:21:58,138 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:21:58,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:21:58,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 04:21:58,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:21:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:21:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1522448959, now seen corresponding path program 1 times [2022-10-16 04:21:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:21:58,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015423155] [2022-10-16 04:21:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:21:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:21:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:58,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:21:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:58,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:21:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:58,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:21:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:58,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:21:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:21:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:58,369 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-16 04:21:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:21:58,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015423155] [2022-10-16 04:21:58,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015423155] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:21:58,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:21:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 04:21:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116335855] [2022-10-16 04:21:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:21:58,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 04:21:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:21:58,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 04:21:58,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:21:58,378 INFO L87 Difference]: Start difference. First operand 1282 states and 1942 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:21:59,622 INFO L93 Difference]: Finished difference Result 3307 states and 5021 transitions. [2022-10-16 04:21:59,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 04:21:59,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-10-16 04:21:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:21:59,644 INFO L225 Difference]: With dead ends: 3307 [2022-10-16 04:21:59,645 INFO L226 Difference]: Without dead ends: 3307 [2022-10-16 04:21:59,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-16 04:21:59,646 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 551 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:21:59,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1228 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 04:21:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2022-10-16 04:21:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 2303. [2022-10-16 04:21:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1988 states have (on average 1.5155935613682092) internal successors, (3013), 2007 states have internal predecessors, (3013), 195 states have call successors, (195), 103 states have call predecessors, (195), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2022-10-16 04:21:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3498 transitions. [2022-10-16 04:21:59,778 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3498 transitions. Word has length 79 [2022-10-16 04:21:59,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:21:59,779 INFO L495 AbstractCegarLoop]: Abstraction has 2303 states and 3498 transitions. [2022-10-16 04:21:59,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:21:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3498 transitions. [2022-10-16 04:21:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 04:21:59,783 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:21:59,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:21:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 04:21:59,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:21:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:21:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash -810943679, now seen corresponding path program 1 times [2022-10-16 04:21:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:21:59,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436487539] [2022-10-16 04:21:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:21:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:21:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:21:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:21:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:21:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:21:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:21:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:21:59,945 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-16 04:21:59,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:21:59,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436487539] [2022-10-16 04:21:59,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436487539] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:21:59,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:21:59,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 04:21:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120167256] [2022-10-16 04:21:59,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:21:59,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 04:21:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:21:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 04:21:59,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:21:59,948 INFO L87 Difference]: Start difference. First operand 2303 states and 3498 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:22:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:00,492 INFO L93 Difference]: Finished difference Result 2886 states and 4422 transitions. [2022-10-16 04:22:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 04:22:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-10-16 04:22:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:00,511 INFO L225 Difference]: With dead ends: 2886 [2022-10-16 04:22:00,511 INFO L226 Difference]: Without dead ends: 2886 [2022-10-16 04:22:00,512 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-16 04:22:00,513 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 405 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:00,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 616 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 04:22:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2022-10-16 04:22:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2303. [2022-10-16 04:22:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1988 states have (on average 1.5070422535211268) internal successors, (2996), 2007 states have internal predecessors, (2996), 195 states have call successors, (195), 103 states have call predecessors, (195), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2022-10-16 04:22:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3481 transitions. [2022-10-16 04:22:00,616 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3481 transitions. Word has length 79 [2022-10-16 04:22:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:00,616 INFO L495 AbstractCegarLoop]: Abstraction has 2303 states and 3481 transitions. [2022-10-16 04:22:00,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:22:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3481 transitions. [2022-10-16 04:22:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 04:22:00,620 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:00,620 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:00,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 04:22:00,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash -609119745, now seen corresponding path program 1 times [2022-10-16 04:22:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:00,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967758270] [2022-10-16 04:22:00,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:00,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:00,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-16 04:22:00,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967758270] [2022-10-16 04:22:00,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967758270] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:00,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:22:00,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 04:22:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307956597] [2022-10-16 04:22:00,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:00,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 04:22:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:00,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 04:22:00,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:22:00,803 INFO L87 Difference]: Start difference. First operand 2303 states and 3481 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:22:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:01,893 INFO L93 Difference]: Finished difference Result 5687 states and 8572 transitions. [2022-10-16 04:22:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 04:22:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-10-16 04:22:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:01,932 INFO L225 Difference]: With dead ends: 5687 [2022-10-16 04:22:01,932 INFO L226 Difference]: Without dead ends: 5687 [2022-10-16 04:22:01,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-10-16 04:22:01,934 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 539 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:01,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1178 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 04:22:01,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5687 states. [2022-10-16 04:22:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5687 to 4433. [2022-10-16 04:22:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4433 states, 3846 states have (on average 1.5080603224128966) internal successors, (5800), 3881 states have internal predecessors, (5800), 355 states have call successors, (355), 199 states have call predecessors, (355), 230 states have return successors, (628), 384 states have call predecessors, (628), 353 states have call successors, (628) [2022-10-16 04:22:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 6783 transitions. [2022-10-16 04:22:02,156 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 6783 transitions. Word has length 79 [2022-10-16 04:22:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:02,158 INFO L495 AbstractCegarLoop]: Abstraction has 4433 states and 6783 transitions. [2022-10-16 04:22:02,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:22:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 6783 transitions. [2022-10-16 04:22:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 04:22:02,164 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:02,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:02,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 04:22:02,165 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:02,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:02,166 INFO L85 PathProgramCache]: Analyzing trace with hash -48419967, now seen corresponding path program 1 times [2022-10-16 04:22:02,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:02,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792881072] [2022-10-16 04:22:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:02,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:02,294 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-16 04:22:02,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:02,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792881072] [2022-10-16 04:22:02,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792881072] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:02,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:22:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 04:22:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882543054] [2022-10-16 04:22:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:02,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 04:22:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:02,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 04:22:02,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 04:22:02,298 INFO L87 Difference]: Start difference. First operand 4433 states and 6783 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:22:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:03,223 INFO L93 Difference]: Finished difference Result 8122 states and 12165 transitions. [2022-10-16 04:22:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 04:22:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-10-16 04:22:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:03,274 INFO L225 Difference]: With dead ends: 8122 [2022-10-16 04:22:03,274 INFO L226 Difference]: Without dead ends: 8122 [2022-10-16 04:22:03,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-10-16 04:22:03,275 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 690 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:03,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 940 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 04:22:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2022-10-16 04:22:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 6628. [2022-10-16 04:22:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6628 states, 5734 states have (on average 1.4907568887338682) internal successors, (8548), 5802 states have internal predecessors, (8548), 544 states have call successors, (544), 301 states have call predecessors, (544), 348 states have return successors, (899), 556 states have call predecessors, (899), 542 states have call successors, (899) [2022-10-16 04:22:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6628 states to 6628 states and 9991 transitions. [2022-10-16 04:22:03,582 INFO L78 Accepts]: Start accepts. Automaton has 6628 states and 9991 transitions. Word has length 79 [2022-10-16 04:22:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:03,583 INFO L495 AbstractCegarLoop]: Abstraction has 6628 states and 9991 transitions. [2022-10-16 04:22:03,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-16 04:22:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6628 states and 9991 transitions. [2022-10-16 04:22:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-10-16 04:22:03,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:03,605 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, 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] [2022-10-16 04:22:03,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 04:22:03,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1920878731, now seen corresponding path program 1 times [2022-10-16 04:22:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:03,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136947688] [2022-10-16 04:22:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 04:22:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 04:22:03,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:03,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136947688] [2022-10-16 04:22:03,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136947688] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:03,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796019206] [2022-10-16 04:22:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:03,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:03,854 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-16 04:22:03,856 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-16 04:22:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:03,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:03,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 04:22:04,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:04,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796019206] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:04,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:04,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-10-16 04:22:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337536681] [2022-10-16 04:22:04,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:04,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:04,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:04,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:04,132 INFO L87 Difference]: Start difference. First operand 6628 states and 9991 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 04:22:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:04,246 INFO L93 Difference]: Finished difference Result 13065 states and 19577 transitions. [2022-10-16 04:22:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:04,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 128 [2022-10-16 04:22:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:04,363 INFO L225 Difference]: With dead ends: 13065 [2022-10-16 04:22:04,363 INFO L226 Difference]: Without dead ends: 13065 [2022-10-16 04:22:04,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:04,364 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 192 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 498 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-16 04:22:04,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 498 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13065 states. [2022-10-16 04:22:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13065 to 12958. [2022-10-16 04:22:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12958 states, 11204 states have (on average 1.488664762584791) internal successors, (16679), 11337 states have internal predecessors, (16679), 1056 states have call successors, (1056), 601 states have call predecessors, (1056), 696 states have return successors, (1737), 1051 states have call predecessors, (1737), 1054 states have call successors, (1737) [2022-10-16 04:22:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 19472 transitions. [2022-10-16 04:22:04,805 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 19472 transitions. Word has length 128 [2022-10-16 04:22:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:04,805 INFO L495 AbstractCegarLoop]: Abstraction has 12958 states and 19472 transitions. [2022-10-16 04:22:04,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 04:22:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 19472 transitions. [2022-10-16 04:22:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-10-16 04:22:04,845 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:04,845 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, 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] [2022-10-16 04:22:04,885 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-16 04:22:05,061 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,SelfDestructingSolverStorable9 [2022-10-16 04:22:05,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:05,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1004785237, now seen corresponding path program 1 times [2022-10-16 04:22:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:05,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483004813] [2022-10-16 04:22:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:05,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 04:22:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 04:22:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:05,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483004813] [2022-10-16 04:22:05,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483004813] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:05,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493803301] [2022-10-16 04:22:05,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:05,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:05,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:05,248 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-16 04:22:05,270 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-16 04:22:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:05,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:05,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 04:22:05,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:05,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493803301] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:05,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:05,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-10-16 04:22:05,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173936973] [2022-10-16 04:22:05,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:05,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:05,431 INFO L87 Difference]: Start difference. First operand 12958 states and 19472 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 04:22:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:05,670 INFO L93 Difference]: Finished difference Result 25547 states and 38185 transitions. [2022-10-16 04:22:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:05,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 128 [2022-10-16 04:22:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:05,859 INFO L225 Difference]: With dead ends: 25547 [2022-10-16 04:22:05,859 INFO L226 Difference]: Without dead ends: 25547 [2022-10-16 04:22:05,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:05,861 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 186 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 459 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-16 04:22:05,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 459 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25547 states. [2022-10-16 04:22:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25547 to 25340. [2022-10-16 04:22:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25340 states, 21892 states have (on average 1.4863420427553444) internal successors, (32539), 22155 states have internal predecessors, (32539), 2054 states have call successors, (2054), 1201 states have call predecessors, (2054), 1392 states have return successors, (3387), 2015 states have call predecessors, (3387), 2052 states have call successors, (3387) [2022-10-16 04:22:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25340 states to 25340 states and 37980 transitions. [2022-10-16 04:22:06,655 INFO L78 Accepts]: Start accepts. Automaton has 25340 states and 37980 transitions. Word has length 128 [2022-10-16 04:22:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:06,655 INFO L495 AbstractCegarLoop]: Abstraction has 25340 states and 37980 transitions. [2022-10-16 04:22:06,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 04:22:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 25340 states and 37980 transitions. [2022-10-16 04:22:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-10-16 04:22:06,715 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:06,715 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, 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] [2022-10-16 04:22:06,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 04:22:06,929 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,SelfDestructingSolverStorable10 [2022-10-16 04:22:06,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2015851211, now seen corresponding path program 1 times [2022-10-16 04:22:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:06,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127020423] [2022-10-16 04:22:06,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 04:22:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 04:22:07,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:07,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127020423] [2022-10-16 04:22:07,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127020423] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:07,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101644036] [2022-10-16 04:22:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:07,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:07,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:07,372 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-16 04:22:07,398 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-16 04:22:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:07,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:07,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 04:22:07,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:07,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101644036] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:07,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:07,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:07,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158659028] [2022-10-16 04:22:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:07,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:07,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:07,536 INFO L87 Difference]: Start difference. First operand 25340 states and 37980 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:22:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:07,917 INFO L93 Difference]: Finished difference Result 49314 states and 74094 transitions. [2022-10-16 04:22:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:07,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 128 [2022-10-16 04:22:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:08,178 INFO L225 Difference]: With dead ends: 49314 [2022-10-16 04:22:08,178 INFO L226 Difference]: Without dead ends: 49314 [2022-10-16 04:22:08,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:08,180 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 195 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:08,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 673 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49314 states. [2022-10-16 04:22:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49314 to 49311. [2022-10-16 04:22:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49311 states, 42556 states have (on average 1.4750681455023968) internal successors, (62773), 43012 states have internal predecessors, (62773), 3969 states have call successors, (3969), 2401 states have call predecessors, (3969), 2784 states have return successors, (7350), 3961 states have call predecessors, (7350), 3967 states have call successors, (7350) [2022-10-16 04:22:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49311 states to 49311 states and 74092 transitions. [2022-10-16 04:22:10,328 INFO L78 Accepts]: Start accepts. Automaton has 49311 states and 74092 transitions. Word has length 128 [2022-10-16 04:22:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:10,329 INFO L495 AbstractCegarLoop]: Abstraction has 49311 states and 74092 transitions. [2022-10-16 04:22:10,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:22:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 49311 states and 74092 transitions. [2022-10-16 04:22:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-10-16 04:22:10,482 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:10,482 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, 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-16 04:22:10,526 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-16 04:22:10,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:10,696 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:10,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -480486446, now seen corresponding path program 1 times [2022-10-16 04:22:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308523170] [2022-10-16 04:22:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 04:22:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 04:22:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 04:22:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-16 04:22:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:22:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-16 04:22:10,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:10,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308523170] [2022-10-16 04:22:10,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308523170] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:10,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990605017] [2022-10-16 04:22:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:10,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:10,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:10,968 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-16 04:22:10,989 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-16 04:22:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:11,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:11,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-10-16 04:22:11,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:11,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990605017] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:11,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:11,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-10-16 04:22:11,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667596563] [2022-10-16 04:22:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:11,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:11,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:11,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:11,192 INFO L87 Difference]: Start difference. First operand 49311 states and 74092 transitions. Second operand has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 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-16 04:22:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:11,542 INFO L93 Difference]: Finished difference Result 49310 states and 74091 transitions. [2022-10-16 04:22:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:11,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 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 148 [2022-10-16 04:22:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:11,798 INFO L225 Difference]: With dead ends: 49310 [2022-10-16 04:22:11,799 INFO L226 Difference]: Without dead ends: 49308 [2022-10-16 04:22:11,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:11,800 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 89 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:11,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 328 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49308 states. [2022-10-16 04:22:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49308 to 49308. [2022-10-16 04:22:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49308 states, 42554 states have (on average 1.4656906518776143) internal successors, (62371), 43009 states have internal predecessors, (62371), 3969 states have call successors, (3969), 2401 states have call predecessors, (3969), 2784 states have return successors, (7350), 3961 states have call predecessors, (7350), 3967 states have call successors, (7350) [2022-10-16 04:22:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49308 states to 49308 states and 73690 transitions. [2022-10-16 04:22:13,500 INFO L78 Accepts]: Start accepts. Automaton has 49308 states and 73690 transitions. Word has length 148 [2022-10-16 04:22:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:13,501 INFO L495 AbstractCegarLoop]: Abstraction has 49308 states and 73690 transitions. [2022-10-16 04:22:13,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 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-16 04:22:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 49308 states and 73690 transitions. [2022-10-16 04:22:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-10-16 04:22:13,742 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:13,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:13,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 04:22:13,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:13,956 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1438242473, now seen corresponding path program 1 times [2022-10-16 04:22:13,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:13,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113094069] [2022-10-16 04:22:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-16 04:22:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-16 04:22:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 04:22:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:14,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113094069] [2022-10-16 04:22:14,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113094069] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:14,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622767919] [2022-10-16 04:22:14,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:14,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:14,178 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-16 04:22:14,198 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-16 04:22:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:14,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:14,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 04:22:14,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:14,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622767919] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:14,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:14,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-10-16 04:22:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794459475] [2022-10-16 04:22:14,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:14,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:14,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:14,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:14,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:14,690 INFO L87 Difference]: Start difference. First operand 49308 states and 73690 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-16 04:22:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:15,331 INFO L93 Difference]: Finished difference Result 96158 states and 142937 transitions. [2022-10-16 04:22:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 166 [2022-10-16 04:22:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:15,855 INFO L225 Difference]: With dead ends: 96158 [2022-10-16 04:22:15,856 INFO L226 Difference]: Without dead ends: 96158 [2022-10-16 04:22:15,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:15,857 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 139 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 456 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-16 04:22:15,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 456 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96158 states. [2022-10-16 04:22:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96158 to 95354. [2022-10-16 04:22:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95354 states, 82548 states have (on average 1.4655352037602365) internal successors, (120977), 83455 states have internal predecessors, (120977), 7383 states have call successors, (7383), 4655 states have call predecessors, (7383), 5422 states have return successors, (13774), 7307 states have call predecessors, (13774), 7381 states have call successors, (13774) [2022-10-16 04:22:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95354 states to 95354 states and 142134 transitions. [2022-10-16 04:22:19,119 INFO L78 Accepts]: Start accepts. Automaton has 95354 states and 142134 transitions. Word has length 166 [2022-10-16 04:22:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:19,119 INFO L495 AbstractCegarLoop]: Abstraction has 95354 states and 142134 transitions. [2022-10-16 04:22:19,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-16 04:22:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 95354 states and 142134 transitions. [2022-10-16 04:22:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-10-16 04:22:20,007 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:20,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:20,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-16 04:22:20,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 04:22:20,222 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1980398189, now seen corresponding path program 1 times [2022-10-16 04:22:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:20,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282011813] [2022-10-16 04:22:20,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 04:22:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-16 04:22:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 04:22:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-10-16 04:22:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-10-16 04:22:20,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:20,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282011813] [2022-10-16 04:22:20,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282011813] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:20,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656822951] [2022-10-16 04:22:20,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:20,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:20,532 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-16 04:22:20,559 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-16 04:22:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:20,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:20,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-10-16 04:22:20,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:20,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656822951] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:20,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:20,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:20,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774535983] [2022-10-16 04:22:20,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:20,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:20,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:20,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:20,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:20,792 INFO L87 Difference]: Start difference. First operand 95354 states and 142134 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-16 04:22:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:21,243 INFO L93 Difference]: Finished difference Result 81322 states and 116062 transitions. [2022-10-16 04:22:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:21,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 184 [2022-10-16 04:22:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:21,970 INFO L225 Difference]: With dead ends: 81322 [2022-10-16 04:22:21,971 INFO L226 Difference]: Without dead ends: 81322 [2022-10-16 04:22:21,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:21,975 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 160 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:21,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 274 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81322 states. [2022-10-16 04:22:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81322 to 57978. [2022-10-16 04:22:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57978 states, 50388 states have (on average 1.413927919345876) internal successors, (71245), 50851 states have internal predecessors, (71245), 4299 states have call successors, (4299), 2907 states have call predecessors, (4299), 3290 states have return successors, (6802), 4251 states have call predecessors, (6802), 4297 states have call successors, (6802) [2022-10-16 04:22:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57978 states to 57978 states and 82346 transitions. [2022-10-16 04:22:23,939 INFO L78 Accepts]: Start accepts. Automaton has 57978 states and 82346 transitions. Word has length 184 [2022-10-16 04:22:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:23,939 INFO L495 AbstractCegarLoop]: Abstraction has 57978 states and 82346 transitions. [2022-10-16 04:22:23,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-16 04:22:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 57978 states and 82346 transitions. [2022-10-16 04:22:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-10-16 04:22:24,080 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:24,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:24,125 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-16 04:22:24,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 04:22:24,296 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1495615436, now seen corresponding path program 1 times [2022-10-16 04:22:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:24,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392781195] [2022-10-16 04:22:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 04:22:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-16 04:22:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 04:22:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-10-16 04:22:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-10-16 04:22:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:24,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392781195] [2022-10-16 04:22:24,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392781195] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032821515] [2022-10-16 04:22:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:24,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:24,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:24,523 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-16 04:22:24,542 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-16 04:22:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:24,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:22:24,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-10-16 04:22:24,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032821515] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:24,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:24,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632404345] [2022-10-16 04:22:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:24,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:24,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:24,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:24,712 INFO L87 Difference]: Start difference. First operand 57978 states and 82346 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-16 04:22:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:24,970 INFO L93 Difference]: Finished difference Result 64612 states and 89682 transitions. [2022-10-16 04:22:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 184 [2022-10-16 04:22:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:25,579 INFO L225 Difference]: With dead ends: 64612 [2022-10-16 04:22:25,579 INFO L226 Difference]: Without dead ends: 64612 [2022-10-16 04:22:25,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:25,582 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 182 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:25,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64612 states. [2022-10-16 04:22:26,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64612 to 64440. [2022-10-16 04:22:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64440 states, 56406 states have (on average 1.3803318795872779) internal successors, (77859), 56869 states have internal predecessors, (77859), 4413 states have call successors, (4413), 3237 states have call predecessors, (4413), 3620 states have return successors, (7230), 4365 states have call predecessors, (7230), 4411 states have call successors, (7230) [2022-10-16 04:22:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64440 states to 64440 states and 89502 transitions. [2022-10-16 04:22:27,200 INFO L78 Accepts]: Start accepts. Automaton has 64440 states and 89502 transitions. Word has length 184 [2022-10-16 04:22:27,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:27,201 INFO L495 AbstractCegarLoop]: Abstraction has 64440 states and 89502 transitions. [2022-10-16 04:22:27,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-16 04:22:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 64440 states and 89502 transitions. [2022-10-16 04:22:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-10-16 04:22:27,343 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:27,344 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:27,385 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-16 04:22:27,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:27,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1593312462, now seen corresponding path program 1 times [2022-10-16 04:22:27,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:27,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747796353] [2022-10-16 04:22:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:27,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 04:22:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-16 04:22:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 04:22:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-10-16 04:22:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-10-16 04:22:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:28,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747796353] [2022-10-16 04:22:28,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747796353] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:28,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533732394] [2022-10-16 04:22:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:28,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:28,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:28,266 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-16 04:22:28,284 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-16 04:22:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:28,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:22:28,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-10-16 04:22:28,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:28,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533732394] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:28,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:28,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140535503] [2022-10-16 04:22:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:28,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:28,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:28,469 INFO L87 Difference]: Start difference. First operand 64440 states and 89502 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 04:22:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:28,736 INFO L93 Difference]: Finished difference Result 68468 states and 93550 transitions. [2022-10-16 04:22:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:28,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 184 [2022-10-16 04:22:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:28,972 INFO L225 Difference]: With dead ends: 68468 [2022-10-16 04:22:28,972 INFO L226 Difference]: Without dead ends: 68468 [2022-10-16 04:22:28,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:28,974 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 158 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:28,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 466 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68468 states. [2022-10-16 04:22:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68468 to 68208. [2022-10-16 04:22:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68208 states, 59918 states have (on average 1.3576387729897526) internal successors, (81347), 60381 states have internal predecessors, (81347), 4457 states have call successors, (4457), 3433 states have call predecessors, (4457), 3832 states have return successors, (7486), 4425 states have call predecessors, (7486), 4455 states have call successors, (7486) [2022-10-16 04:22:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68208 states to 68208 states and 93290 transitions. [2022-10-16 04:22:30,948 INFO L78 Accepts]: Start accepts. Automaton has 68208 states and 93290 transitions. Word has length 184 [2022-10-16 04:22:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:30,948 INFO L495 AbstractCegarLoop]: Abstraction has 68208 states and 93290 transitions. [2022-10-16 04:22:30,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 04:22:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 68208 states and 93290 transitions. [2022-10-16 04:22:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-10-16 04:22:31,098 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:31,098 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:31,134 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-16 04:22:31,313 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,SelfDestructingSolverStorable16 [2022-10-16 04:22:31,314 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1452288335, now seen corresponding path program 1 times [2022-10-16 04:22:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:31,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265768092] [2022-10-16 04:22:31,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 04:22:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-10-16 04:22:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 04:22:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-10-16 04:22:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265768092] [2022-10-16 04:22:31,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265768092] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395020010] [2022-10-16 04:22:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:31,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:31,540 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:22:31,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 04:22:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:31,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:31,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 04:22:31,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:31,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395020010] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:31,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:31,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:31,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377525667] [2022-10-16 04:22:31,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:31,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:31,741 INFO L87 Difference]: Start difference. First operand 68208 states and 93290 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:22:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:32,636 INFO L93 Difference]: Finished difference Result 101404 states and 139965 transitions. [2022-10-16 04:22:32,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 185 [2022-10-16 04:22:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:32,980 INFO L225 Difference]: With dead ends: 101404 [2022-10-16 04:22:32,980 INFO L226 Difference]: Without dead ends: 101404 [2022-10-16 04:22:32,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:32,981 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 182 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:32,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 653 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101404 states. [2022-10-16 04:22:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101404 to 101280. [2022-10-16 04:22:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101280 states, 89000 states have (on average 1.3548651685393258) internal successors, (120583), 89693 states have internal predecessors, (120583), 6561 states have call successors, (6561), 5089 states have call predecessors, (6561), 5718 states have return successors, (12690), 6529 states have call predecessors, (12690), 6559 states have call successors, (12690) [2022-10-16 04:22:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101280 states to 101280 states and 139834 transitions. [2022-10-16 04:22:36,023 INFO L78 Accepts]: Start accepts. Automaton has 101280 states and 139834 transitions. Word has length 185 [2022-10-16 04:22:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:36,024 INFO L495 AbstractCegarLoop]: Abstraction has 101280 states and 139834 transitions. [2022-10-16 04:22:36,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:22:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 101280 states and 139834 transitions. [2022-10-16 04:22:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-10-16 04:22:36,230 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:36,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:22:36,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-10-16 04:22:36,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 04:22:36,446 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:36,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2003869653, now seen corresponding path program 1 times [2022-10-16 04:22:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:36,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157632710] [2022-10-16 04:22:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 04:22:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:22:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 04:22:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-16 04:22:36,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:36,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157632710] [2022-10-16 04:22:36,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157632710] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:36,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346105035] [2022-10-16 04:22:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:36,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:36,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:36,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:22:36,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 04:22:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:36,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:36,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-10-16 04:22:36,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:36,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346105035] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:36,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:36,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226486402] [2022-10-16 04:22:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:36,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:36,901 INFO L87 Difference]: Start difference. First operand 101280 states and 139834 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-16 04:22:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:37,641 INFO L93 Difference]: Finished difference Result 91736 states and 123046 transitions. [2022-10-16 04:22:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:37,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 185 [2022-10-16 04:22:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:37,868 INFO L225 Difference]: With dead ends: 91736 [2022-10-16 04:22:37,869 INFO L226 Difference]: Without dead ends: 91736 [2022-10-16 04:22:37,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:37,869 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 154 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:37,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91736 states. [2022-10-16 04:22:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91736 to 60864. [2022-10-16 04:22:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60864 states, 53594 states have (on average 1.320203754151584) internal successors, (70755), 53953 states have internal predecessors, (70755), 3865 states have call successors, (3865), 3073 states have call predecessors, (3865), 3404 states have return successors, (6718), 3853 states have call predecessors, (6718), 3863 states have call successors, (6718) [2022-10-16 04:22:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60864 states to 60864 states and 81338 transitions. [2022-10-16 04:22:39,512 INFO L78 Accepts]: Start accepts. Automaton has 60864 states and 81338 transitions. Word has length 185 [2022-10-16 04:22:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:39,512 INFO L495 AbstractCegarLoop]: Abstraction has 60864 states and 81338 transitions. [2022-10-16 04:22:39,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-16 04:22:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 60864 states and 81338 transitions. [2022-10-16 04:22:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-10-16 04:22:39,573 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:39,574 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:39,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-10-16 04:22:39,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:39,780 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:39,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash 597689368, now seen corresponding path program 1 times [2022-10-16 04:22:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:39,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224762635] [2022-10-16 04:22:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:39,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 04:22:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:22:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 04:22:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-10-16 04:22:39,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:39,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224762635] [2022-10-16 04:22:39,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224762635] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:39,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067872981] [2022-10-16 04:22:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:39,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:39,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:40,000 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:22:40,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 04:22:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:40,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:40,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 04:22:40,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:40,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067872981] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:40,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:40,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110391318] [2022-10-16 04:22:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:40,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:40,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:40,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:40,159 INFO L87 Difference]: Start difference. First operand 60864 states and 81338 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:22:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:41,045 INFO L93 Difference]: Finished difference Result 114044 states and 154829 transitions. [2022-10-16 04:22:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:41,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 185 [2022-10-16 04:22:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:41,511 INFO L225 Difference]: With dead ends: 114044 [2022-10-16 04:22:41,511 INFO L226 Difference]: Without dead ends: 114044 [2022-10-16 04:22:41,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:41,512 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 185 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:41,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 654 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114044 states. [2022-10-16 04:22:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114044 to 114040. [2022-10-16 04:22:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114040 states, 100208 states have (on average 1.315074644738943) internal successors, (131781), 100925 states have internal predecessors, (131781), 7375 states have call successors, (7375), 5793 states have call predecessors, (7375), 6456 states have return successors, (15670), 7353 states have call predecessors, (15670), 7373 states have call successors, (15670) [2022-10-16 04:22:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114040 states to 114040 states and 154826 transitions. [2022-10-16 04:22:43,884 INFO L78 Accepts]: Start accepts. Automaton has 114040 states and 154826 transitions. Word has length 185 [2022-10-16 04:22:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:43,885 INFO L495 AbstractCegarLoop]: Abstraction has 114040 states and 154826 transitions. [2022-10-16 04:22:43,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:22:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 114040 states and 154826 transitions. [2022-10-16 04:22:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-10-16 04:22:44,035 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:44,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:44,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 04:22:44,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:44,244 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:44,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash 119695257, now seen corresponding path program 1 times [2022-10-16 04:22:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:44,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550086768] [2022-10-16 04:22:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:44,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 04:22:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 04:22:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 04:22:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 04:22:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-10-16 04:22:44,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:44,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550086768] [2022-10-16 04:22:44,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550086768] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:44,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355972258] [2022-10-16 04:22:44,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:44,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:44,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:44,441 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:22:44,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 04:22:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:44,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:22:44,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-16 04:22:44,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:44,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355972258] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:44,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:44,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349420223] [2022-10-16 04:22:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:44,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:44,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:44,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:44,590 INFO L87 Difference]: Start difference. First operand 114040 states and 154826 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:22:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:45,848 INFO L93 Difference]: Finished difference Result 212064 states and 291109 transitions. [2022-10-16 04:22:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 185 [2022-10-16 04:22:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:47,043 INFO L225 Difference]: With dead ends: 212064 [2022-10-16 04:22:47,043 INFO L226 Difference]: Without dead ends: 212064 [2022-10-16 04:22:47,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:47,044 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 195 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:47,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 656 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212064 states. [2022-10-16 04:22:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212064 to 211884. [2022-10-16 04:22:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211884 states, 185784 states have (on average 1.3078790423287259) internal successors, (242983), 187217 states have internal predecessors, (242983), 14011 states have call successors, (14011), 10849 states have call predecessors, (14011), 12088 states have return successors, (33826), 13881 states have call predecessors, (33826), 14009 states have call successors, (33826) [2022-10-16 04:22:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211884 states to 211884 states and 290820 transitions. [2022-10-16 04:22:51,859 INFO L78 Accepts]: Start accepts. Automaton has 211884 states and 290820 transitions. Word has length 185 [2022-10-16 04:22:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:22:51,859 INFO L495 AbstractCegarLoop]: Abstraction has 211884 states and 290820 transitions. [2022-10-16 04:22:51,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:22:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 211884 states and 290820 transitions. [2022-10-16 04:22:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-10-16 04:22:52,051 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:22:52,051 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:22:52,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 04:22:52,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-10-16 04:22:52,252 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:22:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:22:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash -599999836, now seen corresponding path program 1 times [2022-10-16 04:22:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:22:52,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798796826] [2022-10-16 04:22:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:52,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:22:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:22:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:22:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:22:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:22:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:22:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 04:22:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 04:22:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-10-16 04:22:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:22:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 04:22:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-10-16 04:22:52,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:22:52,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798796826] [2022-10-16 04:22:52,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798796826] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:22:52,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069306034] [2022-10-16 04:22:52,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:22:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:22:52,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:22:52,440 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:22:52,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 04:22:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:22:52,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:22:52,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:22:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-10-16 04:22:52,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:22:52,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069306034] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:22:52,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:22:52,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:22:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123321630] [2022-10-16 04:22:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:22:52,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:22:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:22:52,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:22:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:52,609 INFO L87 Difference]: Start difference. First operand 211884 states and 290820 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 04:22:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:22:53,848 INFO L93 Difference]: Finished difference Result 221728 states and 303449 transitions. [2022-10-16 04:22:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:22:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 185 [2022-10-16 04:22:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:22:55,052 INFO L225 Difference]: With dead ends: 221728 [2022-10-16 04:22:55,053 INFO L226 Difference]: Without dead ends: 221728 [2022-10-16 04:22:55,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:22:55,054 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 177 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:22:55,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 504 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:22:55,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221728 states. [2022-10-16 04:22:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221728 to 211868. [2022-10-16 04:22:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211868 states, 185768 states have (on average 1.302221049911718) internal successors, (241911), 187201 states have internal predecessors, (241911), 14011 states have call successors, (14011), 10849 states have call predecessors, (14011), 12088 states have return successors, (33826), 13881 states have call predecessors, (33826), 14009 states have call successors, (33826) [2022-10-16 04:23:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211868 states to 211868 states and 289748 transitions. [2022-10-16 04:23:00,584 INFO L78 Accepts]: Start accepts. Automaton has 211868 states and 289748 transitions. Word has length 185 [2022-10-16 04:23:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:00,584 INFO L495 AbstractCegarLoop]: Abstraction has 211868 states and 289748 transitions. [2022-10-16 04:23:00,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 04:23:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 211868 states and 289748 transitions. [2022-10-16 04:23:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-10-16 04:23:00,851 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:00,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:00,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 04:23:01,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-16 04:23:01,065 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash 853716624, now seen corresponding path program 1 times [2022-10-16 04:23:01,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:01,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834329783] [2022-10-16 04:23:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:01,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 04:23:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 04:23:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 04:23:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 04:23:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-10-16 04:23:01,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:01,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834329783] [2022-10-16 04:23:01,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834329783] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:01,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78558786] [2022-10-16 04:23:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:01,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:01,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:01,448 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:01,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 04:23:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:01,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:23:01,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-10-16 04:23:01,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:01,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78558786] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:01,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:01,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:23:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776274556] [2022-10-16 04:23:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:01,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:23:01,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:01,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:23:01,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:01,703 INFO L87 Difference]: Start difference. First operand 211868 states and 289748 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 04:23:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:04,019 INFO L93 Difference]: Finished difference Result 218088 states and 297811 transitions. [2022-10-16 04:23:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:23:04,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 185 [2022-10-16 04:23:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:04,921 INFO L225 Difference]: With dead ends: 218088 [2022-10-16 04:23:04,922 INFO L226 Difference]: Without dead ends: 218088 [2022-10-16 04:23:04,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:04,928 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 180 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:23:04,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 461 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:23:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218088 states. [2022-10-16 04:23:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218088 to 211620. [2022-10-16 04:23:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211620 states, 185520 states have (on average 1.2952727468736525) internal successors, (240299), 186953 states have internal predecessors, (240299), 14011 states have call successors, (14011), 10849 states have call predecessors, (14011), 12088 states have return successors, (33826), 13881 states have call predecessors, (33826), 14009 states have call successors, (33826) [2022-10-16 04:23:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211620 states to 211620 states and 288136 transitions. [2022-10-16 04:23:09,691 INFO L78 Accepts]: Start accepts. Automaton has 211620 states and 288136 transitions. Word has length 185 [2022-10-16 04:23:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:09,691 INFO L495 AbstractCegarLoop]: Abstraction has 211620 states and 288136 transitions. [2022-10-16 04:23:09,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 04:23:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 211620 states and 288136 transitions. [2022-10-16 04:23:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-10-16 04:23:09,882 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:09,882 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:09,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-10-16 04:23:10,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:10,091 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2001355102, now seen corresponding path program 1 times [2022-10-16 04:23:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:10,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300768947] [2022-10-16 04:23:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 04:23:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 04:23:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-10-16 04:23:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 04:23:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-10-16 04:23:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:10,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300768947] [2022-10-16 04:23:10,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300768947] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:10,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:23:10,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 04:23:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272302320] [2022-10-16 04:23:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:10,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:23:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:23:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:23:10,251 INFO L87 Difference]: Start difference. First operand 211620 states and 288136 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 04:23:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:11,794 INFO L93 Difference]: Finished difference Result 217254 states and 289010 transitions. [2022-10-16 04:23:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:23:11,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 185 [2022-10-16 04:23:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:12,891 INFO L225 Difference]: With dead ends: 217254 [2022-10-16 04:23:12,891 INFO L226 Difference]: Without dead ends: 217254 [2022-10-16 04:23:12,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 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-16 04:23:12,892 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 370 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 04:23:12,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 398 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 04:23:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217254 states. [2022-10-16 04:23:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217254 to 202246. [2022-10-16 04:23:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202246 states, 179054 states have (on average 1.2913255219095916) internal successors, (231217), 182233 states have internal predecessors, (231217), 10687 states have call successors, (10687), 8321 states have call predecessors, (10687), 12504 states have return successors, (28183), 11723 states have call predecessors, (28183), 10685 states have call successors, (28183) [2022-10-16 04:23:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202246 states to 202246 states and 270087 transitions. [2022-10-16 04:23:17,302 INFO L78 Accepts]: Start accepts. Automaton has 202246 states and 270087 transitions. Word has length 185 [2022-10-16 04:23:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:17,302 INFO L495 AbstractCegarLoop]: Abstraction has 202246 states and 270087 transitions. [2022-10-16 04:23:17,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 04:23:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 202246 states and 270087 transitions. [2022-10-16 04:23:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-10-16 04:23:17,442 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:17,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:17,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 04:23:17,443 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash 658555144, now seen corresponding path program 1 times [2022-10-16 04:23:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:17,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579402499] [2022-10-16 04:23:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:17,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:17,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 04:23:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 04:23:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:18,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:18,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-10-16 04:23:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-10-16 04:23:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-10-16 04:23:18,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:18,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579402499] [2022-10-16 04:23:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579402499] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:18,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144537197] [2022-10-16 04:23:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:18,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:18,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:18,195 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:18,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 04:23:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:18,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:23:18,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-16 04:23:18,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:18,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144537197] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:18,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:18,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:23:18,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631212271] [2022-10-16 04:23:18,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:18,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:23:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:23:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:18,421 INFO L87 Difference]: Start difference. First operand 202246 states and 270087 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 04:23:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:19,633 INFO L93 Difference]: Finished difference Result 204098 states and 272220 transitions. [2022-10-16 04:23:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:23:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 187 [2022-10-16 04:23:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:20,243 INFO L225 Difference]: With dead ends: 204098 [2022-10-16 04:23:20,243 INFO L226 Difference]: Without dead ends: 204098 [2022-10-16 04:23:20,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:20,248 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 183 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:23:20,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 483 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:23:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204098 states. [2022-10-16 04:23:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204098 to 202246. [2022-10-16 04:23:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202246 states, 179054 states have (on average 1.2880751058339943) internal successors, (230635), 182233 states have internal predecessors, (230635), 10687 states have call successors, (10687), 8321 states have call predecessors, (10687), 12504 states have return successors, (28183), 11723 states have call predecessors, (28183), 10685 states have call successors, (28183) [2022-10-16 04:23:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202246 states to 202246 states and 269505 transitions. [2022-10-16 04:23:24,773 INFO L78 Accepts]: Start accepts. Automaton has 202246 states and 269505 transitions. Word has length 187 [2022-10-16 04:23:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:24,773 INFO L495 AbstractCegarLoop]: Abstraction has 202246 states and 269505 transitions. [2022-10-16 04:23:24,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-16 04:23:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 202246 states and 269505 transitions. [2022-10-16 04:23:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-10-16 04:23:24,971 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:24,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:24,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 04:23:25,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:25,179 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:25,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash 472661640, now seen corresponding path program 1 times [2022-10-16 04:23:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:25,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256196102] [2022-10-16 04:23:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 04:23:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 04:23:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-10-16 04:23:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-10-16 04:23:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-10-16 04:23:25,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:25,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256196102] [2022-10-16 04:23:25,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256196102] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:25,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:23:25,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 04:23:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094246694] [2022-10-16 04:23:25,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:25,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:23:25,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:25,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:23:25,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:23:25,302 INFO L87 Difference]: Start difference. First operand 202246 states and 269505 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 04:23:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:26,648 INFO L93 Difference]: Finished difference Result 165330 states and 218642 transitions. [2022-10-16 04:23:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:23:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 187 [2022-10-16 04:23:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:27,111 INFO L225 Difference]: With dead ends: 165330 [2022-10-16 04:23:27,111 INFO L226 Difference]: Without dead ends: 165330 [2022-10-16 04:23:27,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 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-16 04:23:27,112 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 367 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 04:23:27,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 396 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 04:23:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165330 states. [2022-10-16 04:23:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165330 to 153002. [2022-10-16 04:23:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153002 states, 135636 states have (on average 1.2926877820047775) internal successors, (175335), 137955 states have internal predecessors, (175335), 8029 states have call successors, (8029), 6281 states have call predecessors, (8029), 9336 states have return successors, (19865), 8781 states have call predecessors, (19865), 8027 states have call successors, (19865) [2022-10-16 04:23:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153002 states to 153002 states and 203229 transitions. [2022-10-16 04:23:31,423 INFO L78 Accepts]: Start accepts. Automaton has 153002 states and 203229 transitions. Word has length 187 [2022-10-16 04:23:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:31,424 INFO L495 AbstractCegarLoop]: Abstraction has 153002 states and 203229 transitions. [2022-10-16 04:23:31,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 04:23:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 153002 states and 203229 transitions. [2022-10-16 04:23:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-10-16 04:23:32,118 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:32,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:32,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-16 04:23:32,121 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:32,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:32,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1614825360, now seen corresponding path program 1 times [2022-10-16 04:23:32,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:32,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772150621] [2022-10-16 04:23:32,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:32,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:23:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:23:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:23:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 04:23:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-16 04:23:32,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:32,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772150621] [2022-10-16 04:23:32,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772150621] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:32,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46738641] [2022-10-16 04:23:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:32,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:32,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:32,393 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:32,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 04:23:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:32,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:23:32,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 04:23:32,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:32,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46738641] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:32,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:32,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:23:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369670664] [2022-10-16 04:23:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:32,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:23:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:32,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:23:32,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:32,578 INFO L87 Difference]: Start difference. First operand 153002 states and 203229 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:23:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:33,634 INFO L93 Difference]: Finished difference Result 153550 states and 201280 transitions. [2022-10-16 04:23:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:23:33,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 189 [2022-10-16 04:23:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:34,103 INFO L225 Difference]: With dead ends: 153550 [2022-10-16 04:23:34,103 INFO L226 Difference]: Without dead ends: 153550 [2022-10-16 04:23:34,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:34,107 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 176 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 563 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-16 04:23:34,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 563 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:23:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153550 states. [2022-10-16 04:23:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153550 to 153002. [2022-10-16 04:23:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153002 states, 135636 states have (on average 1.2742855878970185) internal successors, (172839), 137955 states have internal predecessors, (172839), 8029 states have call successors, (8029), 6281 states have call predecessors, (8029), 9336 states have return successors, (19865), 8781 states have call predecessors, (19865), 8027 states have call successors, (19865) [2022-10-16 04:23:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153002 states to 153002 states and 200733 transitions. [2022-10-16 04:23:36,955 INFO L78 Accepts]: Start accepts. Automaton has 153002 states and 200733 transitions. Word has length 189 [2022-10-16 04:23:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:36,955 INFO L495 AbstractCegarLoop]: Abstraction has 153002 states and 200733 transitions. [2022-10-16 04:23:36,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:23:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 153002 states and 200733 transitions. [2022-10-16 04:23:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-10-16 04:23:37,059 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:37,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:37,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-10-16 04:23:37,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-16 04:23:37,261 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:37,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash 178164464, now seen corresponding path program 1 times [2022-10-16 04:23:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:37,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348577107] [2022-10-16 04:23:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:37,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:23:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:23:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:23:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 04:23:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-16 04:23:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:37,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348577107] [2022-10-16 04:23:37,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348577107] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:37,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822352780] [2022-10-16 04:23:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:37,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:37,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:37,462 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:38,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 04:23:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:38,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 04:23:38,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-16 04:23:38,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:38,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822352780] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:38,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:38,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:23:38,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036268934] [2022-10-16 04:23:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:38,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:23:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:23:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:38,189 INFO L87 Difference]: Start difference. First operand 153002 states and 200733 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-16 04:23:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:38,628 INFO L93 Difference]: Finished difference Result 127993 states and 163756 transitions. [2022-10-16 04:23:38,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:23:38,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 189 [2022-10-16 04:23:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:38,907 INFO L225 Difference]: With dead ends: 127993 [2022-10-16 04:23:38,907 INFO L226 Difference]: Without dead ends: 127993 [2022-10-16 04:23:38,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:38,908 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 201 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:23:38,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 269 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:23:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127993 states. [2022-10-16 04:23:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127993 to 122245. [2022-10-16 04:23:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122245 states, 108643 states have (on average 1.2463113132001142) internal successors, (135403), 110443 states have internal predecessors, (135403), 6317 states have call successors, (6317), 4953 states have call predecessors, (6317), 7284 states have return successors, (14358), 6856 states have call predecessors, (14358), 6315 states have call successors, (14358) [2022-10-16 04:23:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122245 states to 122245 states and 156078 transitions. [2022-10-16 04:23:41,456 INFO L78 Accepts]: Start accepts. Automaton has 122245 states and 156078 transitions. Word has length 189 [2022-10-16 04:23:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:41,457 INFO L495 AbstractCegarLoop]: Abstraction has 122245 states and 156078 transitions. [2022-10-16 04:23:41,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-16 04:23:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 122245 states and 156078 transitions. [2022-10-16 04:23:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-10-16 04:23:41,522 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:41,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:41,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-10-16 04:23:41,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 04:23:41,724 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1129264874, now seen corresponding path program 1 times [2022-10-16 04:23:41,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:41,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373754222] [2022-10-16 04:23:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:41,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:23:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:23:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-10-16 04:23:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 04:23:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-16 04:23:41,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:41,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373754222] [2022-10-16 04:23:41,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373754222] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:41,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433931823] [2022-10-16 04:23:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:41,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:41,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:41,903 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:41,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 04:23:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:42,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:23:42,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 04:23:42,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:42,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433931823] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:42,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:42,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:23:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898781713] [2022-10-16 04:23:42,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:42,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:23:42,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:42,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:23:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:42,086 INFO L87 Difference]: Start difference. First operand 122245 states and 156078 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:23:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:42,902 INFO L93 Difference]: Finished difference Result 122612 states and 154049 transitions. [2022-10-16 04:23:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:23:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 189 [2022-10-16 04:23:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:43,196 INFO L225 Difference]: With dead ends: 122612 [2022-10-16 04:23:43,196 INFO L226 Difference]: Without dead ends: 122612 [2022-10-16 04:23:43,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:43,197 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 169 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 611 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-16 04:23:43,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 611 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:23:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122612 states. [2022-10-16 04:23:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122612 to 122200. [2022-10-16 04:23:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122200 states, 108598 states have (on average 1.2243595646328662) internal successors, (132963), 110398 states have internal predecessors, (132963), 6317 states have call successors, (6317), 4953 states have call predecessors, (6317), 7284 states have return successors, (14358), 6856 states have call predecessors, (14358), 6315 states have call successors, (14358) [2022-10-16 04:23:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122200 states to 122200 states and 153638 transitions. [2022-10-16 04:23:45,730 INFO L78 Accepts]: Start accepts. Automaton has 122200 states and 153638 transitions. Word has length 189 [2022-10-16 04:23:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:45,731 INFO L495 AbstractCegarLoop]: Abstraction has 122200 states and 153638 transitions. [2022-10-16 04:23:45,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:23:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 122200 states and 153638 transitions. [2022-10-16 04:23:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-10-16 04:23:45,795 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:45,795 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:45,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-16 04:23:46,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-16 04:23:46,001 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:46,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:46,002 INFO L85 PathProgramCache]: Analyzing trace with hash -715534567, now seen corresponding path program 1 times [2022-10-16 04:23:46,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:46,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633103852] [2022-10-16 04:23:46,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:46,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:23:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:23:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-16 04:23:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 04:23:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-10-16 04:23:46,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:46,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633103852] [2022-10-16 04:23:46,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633103852] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:46,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528077681] [2022-10-16 04:23:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:46,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:46,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:46,202 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:46,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-16 04:23:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:46,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:23:46,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 04:23:46,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:46,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528077681] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:46,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:46,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:23:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257402517] [2022-10-16 04:23:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:46,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:23:46,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:46,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:23:46,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:46,395 INFO L87 Difference]: Start difference. First operand 122200 states and 153638 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:23:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:47,246 INFO L93 Difference]: Finished difference Result 122612 states and 151689 transitions. [2022-10-16 04:23:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:23:47,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 189 [2022-10-16 04:23:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:47,541 INFO L225 Difference]: With dead ends: 122612 [2022-10-16 04:23:47,541 INFO L226 Difference]: Without dead ends: 122612 [2022-10-16 04:23:47,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:47,543 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 165 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 615 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-16 04:23:47,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 615 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:23:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122612 states. [2022-10-16 04:23:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122612 to 122200. [2022-10-16 04:23:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122200 states, 108598 states have (on average 1.202628041032063) internal successors, (130603), 110398 states have internal predecessors, (130603), 6317 states have call successors, (6317), 4953 states have call predecessors, (6317), 7284 states have return successors, (14358), 6856 states have call predecessors, (14358), 6315 states have call successors, (14358) [2022-10-16 04:23:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122200 states to 122200 states and 151278 transitions. [2022-10-16 04:23:49,913 INFO L78 Accepts]: Start accepts. Automaton has 122200 states and 151278 transitions. Word has length 189 [2022-10-16 04:23:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:49,919 INFO L495 AbstractCegarLoop]: Abstraction has 122200 states and 151278 transitions. [2022-10-16 04:23:49,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-10-16 04:23:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 122200 states and 151278 transitions. [2022-10-16 04:23:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-10-16 04:23:50,082 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:50,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:50,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-10-16 04:23:50,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:50,283 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -714447947, now seen corresponding path program 1 times [2022-10-16 04:23:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:50,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952603955] [2022-10-16 04:23:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:23:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:23:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:23:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 04:23:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-16 04:23:50,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:50,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952603955] [2022-10-16 04:23:50,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952603955] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:50,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75495732] [2022-10-16 04:23:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:50,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:50,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:50,485 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:50,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-16 04:23:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:50,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 04:23:50,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-16 04:23:50,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:50,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75495732] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:50,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:50,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-10-16 04:23:50,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67690213] [2022-10-16 04:23:50,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:50,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:23:50,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:50,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:23:50,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:50,649 INFO L87 Difference]: Start difference. First operand 122200 states and 151278 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-16 04:23:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:50,994 INFO L93 Difference]: Finished difference Result 122350 states and 150536 transitions. [2022-10-16 04:23:50,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:23:50,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 190 [2022-10-16 04:23:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:51,724 INFO L225 Difference]: With dead ends: 122350 [2022-10-16 04:23:51,724 INFO L226 Difference]: Without dead ends: 122350 [2022-10-16 04:23:51,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:23:51,725 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 192 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:23:51,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 582 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:23:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122350 states. [2022-10-16 04:23:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122350 to 122200. [2022-10-16 04:23:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122200 states, 108598 states have (on average 1.1944142617727767) internal successors, (129711), 110398 states have internal predecessors, (129711), 6317 states have call successors, (6317), 4953 states have call predecessors, (6317), 7284 states have return successors, (14358), 6856 states have call predecessors, (14358), 6315 states have call successors, (14358) [2022-10-16 04:23:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122200 states to 122200 states and 150386 transitions. [2022-10-16 04:23:53,710 INFO L78 Accepts]: Start accepts. Automaton has 122200 states and 150386 transitions. Word has length 190 [2022-10-16 04:23:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:53,711 INFO L495 AbstractCegarLoop]: Abstraction has 122200 states and 150386 transitions. [2022-10-16 04:23:53,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-10-16 04:23:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 122200 states and 150386 transitions. [2022-10-16 04:23:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-10-16 04:23:53,778 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:53,778 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:53,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-10-16 04:23:53,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-10-16 04:23:53,985 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1086976812, now seen corresponding path program 1 times [2022-10-16 04:23:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:53,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182066697] [2022-10-16 04:23:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:23:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:23:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:23:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 04:23:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-16 04:23:54,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:54,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182066697] [2022-10-16 04:23:54,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182066697] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:54,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417762829] [2022-10-16 04:23:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:54,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:54,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:54,164 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:54,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-10-16 04:23:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:54,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 04:23:54,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-10-16 04:23:54,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:54,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417762829] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:54,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:54,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-10-16 04:23:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661651169] [2022-10-16 04:23:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:54,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:23:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:54,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:23:54,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-16 04:23:54,874 INFO L87 Difference]: Start difference. First operand 122200 states and 150386 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:23:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:55,333 INFO L93 Difference]: Finished difference Result 85736 states and 104203 transitions. [2022-10-16 04:23:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:23:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2022-10-16 04:23:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:55,599 INFO L225 Difference]: With dead ends: 85736 [2022-10-16 04:23:55,599 INFO L226 Difference]: Without dead ends: 85736 [2022-10-16 04:23:55,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-10-16 04:23:55,601 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 232 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:23:55,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 426 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:23:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85736 states. [2022-10-16 04:23:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85736 to 85436. [2022-10-16 04:23:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85436 states, 75982 states have (on average 1.1784764812718802) internal successors, (89543), 77165 states have internal predecessors, (89543), 4437 states have call successors, (4437), 3457 states have call predecessors, (4437), 5016 states have return successors, (9899), 4817 states have call predecessors, (9899), 4435 states have call successors, (9899) [2022-10-16 04:23:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85436 states to 85436 states and 103879 transitions. [2022-10-16 04:23:57,502 INFO L78 Accepts]: Start accepts. Automaton has 85436 states and 103879 transitions. Word has length 191 [2022-10-16 04:23:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:23:57,502 INFO L495 AbstractCegarLoop]: Abstraction has 85436 states and 103879 transitions. [2022-10-16 04:23:57,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:23:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 85436 states and 103879 transitions. [2022-10-16 04:23:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-10-16 04:23:57,534 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:23:57,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:23:57,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-10-16 04:23:57,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:57,736 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:23:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:23:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1048906390, now seen corresponding path program 1 times [2022-10-16 04:23:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:23:57,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686640997] [2022-10-16 04:23:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:57,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:23:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:23:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:23:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:23:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:23:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:23:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:23:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:23:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:23:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:23:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 04:23:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-16 04:23:57,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:23:57,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686640997] [2022-10-16 04:23:57,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686640997] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:23:57,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32507616] [2022-10-16 04:23:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:23:57,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:23:57,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:23:57,940 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:23:57,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-10-16 04:23:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:23:58,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 04:23:58,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:23:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-10-16 04:23:58,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:23:58,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32507616] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:23:58,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:23:58,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-10-16 04:23:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23080228] [2022-10-16 04:23:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:23:58,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:23:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:23:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:23:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-16 04:23:58,185 INFO L87 Difference]: Start difference. First operand 85436 states and 103879 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:23:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:23:58,961 INFO L93 Difference]: Finished difference Result 85004 states and 102043 transitions. [2022-10-16 04:23:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:23:58,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2022-10-16 04:23:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:23:59,169 INFO L225 Difference]: With dead ends: 85004 [2022-10-16 04:23:59,170 INFO L226 Difference]: Without dead ends: 85004 [2022-10-16 04:23:59,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-10-16 04:23:59,171 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 228 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:23:59,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 419 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:23:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85004 states. [2022-10-16 04:24:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85004 to 85004. [2022-10-16 04:24:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85004 states, 75550 states have (on average 1.1609133024487095) internal successors, (87707), 76733 states have internal predecessors, (87707), 4437 states have call successors, (4437), 3457 states have call predecessors, (4437), 5016 states have return successors, (9899), 4817 states have call predecessors, (9899), 4435 states have call successors, (9899) [2022-10-16 04:24:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85004 states to 85004 states and 102043 transitions. [2022-10-16 04:24:00,798 INFO L78 Accepts]: Start accepts. Automaton has 85004 states and 102043 transitions. Word has length 191 [2022-10-16 04:24:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:24:00,798 INFO L495 AbstractCegarLoop]: Abstraction has 85004 states and 102043 transitions. [2022-10-16 04:24:00,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 85004 states and 102043 transitions. [2022-10-16 04:24:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-10-16 04:24:00,842 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:24:00,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:24:00,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-10-16 04:24:01,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:24:01,044 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:24:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:24:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1458191084, now seen corresponding path program 1 times [2022-10-16 04:24:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:24:01,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265355288] [2022-10-16 04:24:01,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:24:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:24:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:24:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:24:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:24:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:24:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:24:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:24:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:24:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 04:24:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-16 04:24:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:24:01,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265355288] [2022-10-16 04:24:01,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265355288] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:24:01,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935789488] [2022-10-16 04:24:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:01,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:24:01,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:24:01,238 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:24:01,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-10-16 04:24:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:01,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 04:24:01,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:24:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-10-16 04:24:01,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:24:01,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935789488] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:24:01,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:24:01,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-10-16 04:24:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729745965] [2022-10-16 04:24:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:24:01,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:24:01,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:24:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:24:01,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-16 04:24:01,469 INFO L87 Difference]: Start difference. First operand 85004 states and 102043 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:24:01,801 INFO L93 Difference]: Finished difference Result 64056 states and 76145 transitions. [2022-10-16 04:24:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:24:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2022-10-16 04:24:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:24:01,920 INFO L225 Difference]: With dead ends: 64056 [2022-10-16 04:24:01,921 INFO L226 Difference]: Without dead ends: 64056 [2022-10-16 04:24:01,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-10-16 04:24:01,921 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 221 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:24:01,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 412 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:24:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64056 states. [2022-10-16 04:24:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64056 to 43942. [2022-10-16 04:24:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43942 states, 39131 states have (on average 1.1463034422836114) internal successors, (44856), 39725 states have internal predecessors, (44856), 2291 states have call successors, (2291), 1739 states have call predecessors, (2291), 2519 states have return successors, (5153), 2479 states have call predecessors, (5153), 2289 states have call successors, (5153) [2022-10-16 04:24:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43942 states to 43942 states and 52300 transitions. [2022-10-16 04:24:02,910 INFO L78 Accepts]: Start accepts. Automaton has 43942 states and 52300 transitions. Word has length 191 [2022-10-16 04:24:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:24:02,911 INFO L495 AbstractCegarLoop]: Abstraction has 43942 states and 52300 transitions. [2022-10-16 04:24:02,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 43942 states and 52300 transitions. [2022-10-16 04:24:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-10-16 04:24:03,209 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:24:03,209 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:24:03,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 04:24:03,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:24:03,410 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:24:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:24:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1527838958, now seen corresponding path program 1 times [2022-10-16 04:24:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:24:03,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691884455] [2022-10-16 04:24:03,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:24:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:24:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:24:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:24:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:24:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:24:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:24:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:24:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-10-16 04:24:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 04:24:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-10-16 04:24:03,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:24:03,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691884455] [2022-10-16 04:24:03,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691884455] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:24:03,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772421437] [2022-10-16 04:24:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:03,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:24:03,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:24:03,838 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:24:03,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-10-16 04:24:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:04,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 04:24:04,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:24:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-10-16 04:24:04,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:24:04,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772421437] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:24:04,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:24:04,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-16 04:24:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358595877] [2022-10-16 04:24:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:24:04,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:24:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:24:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:24:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:24:04,124 INFO L87 Difference]: Start difference. First operand 43942 states and 52300 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:24:04,412 INFO L93 Difference]: Finished difference Result 39245 states and 45490 transitions. [2022-10-16 04:24:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:24:04,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2022-10-16 04:24:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:24:04,477 INFO L225 Difference]: With dead ends: 39245 [2022-10-16 04:24:04,477 INFO L226 Difference]: Without dead ends: 30566 [2022-10-16 04:24:04,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-16 04:24:04,480 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 126 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:24:04,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 879 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:24:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30566 states. [2022-10-16 04:24:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30566 to 28686. [2022-10-16 04:24:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28686 states, 25393 states have (on average 1.1297207891938723) internal successors, (28687), 25785 states have internal predecessors, (28687), 1573 states have call successors, (1573), 1206 states have call predecessors, (1573), 1719 states have return successors, (3105), 1695 states have call predecessors, (3105), 1571 states have call successors, (3105) [2022-10-16 04:24:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28686 states to 28686 states and 33365 transitions. [2022-10-16 04:24:05,369 INFO L78 Accepts]: Start accepts. Automaton has 28686 states and 33365 transitions. Word has length 191 [2022-10-16 04:24:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:24:05,369 INFO L495 AbstractCegarLoop]: Abstraction has 28686 states and 33365 transitions. [2022-10-16 04:24:05,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 28686 states and 33365 transitions. [2022-10-16 04:24:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-10-16 04:24:05,394 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:24:05,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:24:05,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-10-16 04:24:05,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:24:05,598 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:24:05,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:24:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash 567454653, now seen corresponding path program 1 times [2022-10-16 04:24:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:24:05,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129050530] [2022-10-16 04:24:05,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:05,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:24:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:24:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:24:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:24:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:24:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:24:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:24:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:24:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-16 04:24:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 04:24:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-10-16 04:24:05,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:24:05,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129050530] [2022-10-16 04:24:05,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129050530] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:24:05,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754205302] [2022-10-16 04:24:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:24:05,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:24:05,794 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:24:05,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-10-16 04:24:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:05,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 04:24:05,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:24:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-10-16 04:24:05,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:24:05,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754205302] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:24:05,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:24:05,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-16 04:24:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240164564] [2022-10-16 04:24:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:24:05,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:24:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:24:05,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:24:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:24:05,955 INFO L87 Difference]: Start difference. First operand 28686 states and 33365 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:24:06,050 INFO L93 Difference]: Finished difference Result 24391 states and 27785 transitions. [2022-10-16 04:24:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:24:06,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2022-10-16 04:24:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:24:06,085 INFO L225 Difference]: With dead ends: 24391 [2022-10-16 04:24:06,086 INFO L226 Difference]: Without dead ends: 24391 [2022-10-16 04:24:06,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-16 04:24:06,090 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 88 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:24:06,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 865 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:24:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24391 states. [2022-10-16 04:24:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24391 to 23381. [2022-10-16 04:24:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23381 states, 20598 states have (on average 1.1129235848140595) internal successors, (22924), 20911 states have internal predecessors, (22924), 1342 states have call successors, (1342), 1020 states have call predecessors, (1342), 1440 states have return successors, (2343), 1450 states have call predecessors, (2343), 1340 states have call successors, (2343) [2022-10-16 04:24:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23381 states to 23381 states and 26609 transitions. [2022-10-16 04:24:06,366 INFO L78 Accepts]: Start accepts. Automaton has 23381 states and 26609 transitions. Word has length 191 [2022-10-16 04:24:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:24:06,367 INFO L495 AbstractCegarLoop]: Abstraction has 23381 states and 26609 transitions. [2022-10-16 04:24:06,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 23381 states and 26609 transitions. [2022-10-16 04:24:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-10-16 04:24:06,374 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:24:06,374 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:24:06,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-10-16 04:24:06,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-10-16 04:24:06,575 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:24:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:24:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash -623452297, now seen corresponding path program 1 times [2022-10-16 04:24:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:24:06,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965684279] [2022-10-16 04:24:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:24:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:24:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:24:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:24:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:24:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:24:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:24:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:24:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-16 04:24:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 04:24:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-10-16 04:24:06,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:24:06,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965684279] [2022-10-16 04:24:06,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965684279] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:24:06,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195778021] [2022-10-16 04:24:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:06,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:24:06,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:24:06,978 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:24:07,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-10-16 04:24:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 04:24:07,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:24:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-10-16 04:24:07,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:24:07,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195778021] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:24:07,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:24:07,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-16 04:24:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906275212] [2022-10-16 04:24:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:24:07,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:24:07,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:24:07,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:24:07,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:24:07,155 INFO L87 Difference]: Start difference. First operand 23381 states and 26609 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:24:07,227 INFO L93 Difference]: Finished difference Result 17961 states and 20001 transitions. [2022-10-16 04:24:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:24:07,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2022-10-16 04:24:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:24:07,254 INFO L225 Difference]: With dead ends: 17961 [2022-10-16 04:24:07,254 INFO L226 Difference]: Without dead ends: 17961 [2022-10-16 04:24:07,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-16 04:24:07,255 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 49 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:24:07,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 850 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:24:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17961 states. [2022-10-16 04:24:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17961 to 17765. [2022-10-16 04:24:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17765 states, 15618 states have (on average 1.0944423101549494) internal successors, (17093), 15831 states have internal predecessors, (17093), 1062 states have call successors, (1062), 800 states have call predecessors, (1062), 1084 states have return successors, (1623), 1134 states have call predecessors, (1623), 1060 states have call successors, (1623) [2022-10-16 04:24:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17765 states to 17765 states and 19778 transitions. [2022-10-16 04:24:07,451 INFO L78 Accepts]: Start accepts. Automaton has 17765 states and 19778 transitions. Word has length 191 [2022-10-16 04:24:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:24:07,451 INFO L495 AbstractCegarLoop]: Abstraction has 17765 states and 19778 transitions. [2022-10-16 04:24:07,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 17765 states and 19778 transitions. [2022-10-16 04:24:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-10-16 04:24:07,457 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:24:07,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:24:07,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-10-16 04:24:07,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-10-16 04:24:07,658 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:24:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:24:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -384637263, now seen corresponding path program 1 times [2022-10-16 04:24:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:24:07,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921404596] [2022-10-16 04:24:07,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:24:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:24:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:24:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:24:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:24:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:24:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 04:24:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 04:24:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-16 04:24:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 04:24:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-10-16 04:24:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:24:07,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921404596] [2022-10-16 04:24:07,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921404596] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:24:07,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136874262] [2022-10-16 04:24:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:07,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:24:07,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:24:07,825 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:24:07,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-10-16 04:24:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:07,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 04:24:07,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:24:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-10-16 04:24:07,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:24:07,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136874262] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:24:07,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:24:07,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-10-16 04:24:07,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780923118] [2022-10-16 04:24:07,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:24:07,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:24:07,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:24:07,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:24:07,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:24:07,987 INFO L87 Difference]: Start difference. First operand 17765 states and 19778 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:24:08,041 INFO L93 Difference]: Finished difference Result 6708 states and 7252 transitions. [2022-10-16 04:24:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:24:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2022-10-16 04:24:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:24:08,078 INFO L225 Difference]: With dead ends: 6708 [2022-10-16 04:24:08,078 INFO L226 Difference]: Without dead ends: 4120 [2022-10-16 04:24:08,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-16 04:24:08,079 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 10 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:24:08,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 835 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:24:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2022-10-16 04:24:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4120. [2022-10-16 04:24:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 3613 states have (on average 1.0686410185441462) internal successors, (3861), 3633 states have internal predecessors, (3861), 289 states have call successors, (289), 202 states have call predecessors, (289), 217 states have return successors, (303), 285 states have call predecessors, (303), 287 states have call successors, (303) [2022-10-16 04:24:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 4453 transitions. [2022-10-16 04:24:08,141 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 4453 transitions. Word has length 191 [2022-10-16 04:24:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:24:08,141 INFO L495 AbstractCegarLoop]: Abstraction has 4120 states and 4453 transitions. [2022-10-16 04:24:08,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 04:24:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 4453 transitions. [2022-10-16 04:24:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-10-16 04:24:08,147 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:24:08,147 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:24:08,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-10-16 04:24:08,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-10-16 04:24:08,355 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:24:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:24:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash 94640057, now seen corresponding path program 1 times [2022-10-16 04:24:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:24:08,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289136676] [2022-10-16 04:24:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:24:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:24:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:24:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:24:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:24:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:24:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 04:24:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 04:24:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-10-16 04:24:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-10-16 04:24:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-10-16 04:24:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-10-16 04:24:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2022-10-16 04:24:08,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:24:08,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289136676] [2022-10-16 04:24:08,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289136676] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:24:08,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:24:08,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 04:24:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877524146] [2022-10-16 04:24:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:24:08,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 04:24:08,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:24:08,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 04:24:08,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:24:08,872 INFO L87 Difference]: Start difference. First operand 4120 states and 4453 transitions. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2022-10-16 04:24:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:24:10,385 INFO L93 Difference]: Finished difference Result 4263 states and 4594 transitions. [2022-10-16 04:24:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 04:24:10,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 282 [2022-10-16 04:24:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:24:10,399 INFO L225 Difference]: With dead ends: 4263 [2022-10-16 04:24:10,400 INFO L226 Difference]: Without dead ends: 4263 [2022-10-16 04:24:10,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-10-16 04:24:10,401 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 1077 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-16 04:24:10,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1511 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-16 04:24:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2022-10-16 04:24:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4119. [2022-10-16 04:24:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4119 states, 3613 states have (on average 1.0680874619429837) internal successors, (3859), 3632 states have internal predecessors, (3859), 288 states have call successors, (288), 202 states have call predecessors, (288), 217 states have return successors, (303), 285 states have call predecessors, (303), 287 states have call successors, (303) [2022-10-16 04:24:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 4450 transitions. [2022-10-16 04:24:10,460 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 4450 transitions. Word has length 282 [2022-10-16 04:24:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:24:10,460 INFO L495 AbstractCegarLoop]: Abstraction has 4119 states and 4450 transitions. [2022-10-16 04:24:10,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2022-10-16 04:24:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 4450 transitions. [2022-10-16 04:24:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-10-16 04:24:10,468 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:24:10,468 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:24:10,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-10-16 04:24:10,471 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:24:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:24:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1585045215, now seen corresponding path program 1 times [2022-10-16 04:24:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:24:10,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912966912] [2022-10-16 04:24:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:24:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 04:24:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 04:24:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 04:24:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 04:24:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 04:24:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 04:24:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 04:24:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-10-16 04:24:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-10-16 04:24:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-10-16 04:24:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-10-16 04:24:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-10-16 04:24:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:24:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2022-10-16 04:24:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:24:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912966912] [2022-10-16 04:24:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912966912] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:24:10,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:24:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 04:24:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514812964] [2022-10-16 04:24:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:24:10,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:24:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:24:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:24:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:24:10,664 INFO L87 Difference]: Start difference. First operand 4119 states and 4450 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-16 04:24:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:24:11,062 INFO L93 Difference]: Finished difference Result 4619 states and 5062 transitions. [2022-10-16 04:24:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:24:11,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 286 [2022-10-16 04:24:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:24:11,078 INFO L225 Difference]: With dead ends: 4619 [2022-10-16 04:24:11,078 INFO L226 Difference]: Without dead ends: 4619 [2022-10-16 04:24:11,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 04:24:11,085 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 246 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 04:24:11,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 655 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 04:24:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2022-10-16 04:24:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4121. [2022-10-16 04:24:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4121 states, 3615 states have (on average 1.0680497925311203) internal successors, (3861), 3634 states have internal predecessors, (3861), 288 states have call successors, (288), 202 states have call predecessors, (288), 217 states have return successors, (303), 285 states have call predecessors, (303), 287 states have call successors, (303) [2022-10-16 04:24:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 4452 transitions. [2022-10-16 04:24:11,161 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 4452 transitions. Word has length 286 [2022-10-16 04:24:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:24:11,162 INFO L495 AbstractCegarLoop]: Abstraction has 4121 states and 4452 transitions. [2022-10-16 04:24:11,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-16 04:24:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 4452 transitions. [2022-10-16 04:24:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-10-16 04:24:11,169 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:24:11,170 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:24:11,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-10-16 04:24:11,170 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, errorErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 04:24:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:24:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash -662632051, now seen corresponding path program 1 times [2022-10-16 04:24:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:24:11,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544611425] [2022-10-16 04:24:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:24:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:24:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 04:24:11,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 04:24:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 04:24:11,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 04:24:11,400 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 04:24:11,402 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-16 04:24:11,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-16 04:24:11,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-10-16 04:24:11,409 INFO L444 BasicCegarLoop]: Path program 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] [2022-10-16 04:24:11,416 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 04:24:11,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:24:11 BoogieIcfgContainer [2022-10-16 04:24:11,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 04:24:11,673 INFO L158 Benchmark]: Toolchain (without parser) took 142836.78ms. Allocated memory was 157.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 131.6MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 934.3MB. Max. memory is 8.0GB. [2022-10-16 04:24:11,673 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 04:24:11,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.83ms. Allocated memory is still 157.3MB. Free memory was 131.4MB in the beginning and 116.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-16 04:24:11,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.80ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 114.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 04:24:11,674 INFO L158 Benchmark]: Boogie Preprocessor took 42.11ms. Allocated memory is still 157.3MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 04:24:11,674 INFO L158 Benchmark]: RCFGBuilder took 940.21ms. Allocated memory is still 157.3MB. Free memory was 112.1MB in the beginning and 124.4MB in the end (delta: -12.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-10-16 04:24:11,675 INFO L158 Benchmark]: TraceAbstraction took 141240.07ms. Allocated memory was 157.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 123.9MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 926.5MB. Max. memory is 8.0GB. [2022-10-16 04:24:11,676 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 537.83ms. Allocated memory is still 157.3MB. Free memory was 131.4MB in the beginning and 116.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.80ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 114.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.11ms. Allocated memory is still 157.3MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 940.21ms. Allocated memory is still 157.3MB. Free memory was 112.1MB in the beginning and 124.4MB in the end (delta: -12.3MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * TraceAbstraction took 141240.07ms. Allocated memory was 157.3MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 123.9MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 926.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int t3_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int t3_st ; [L32] int m_i ; [L33] int t1_i ; [L34] int t2_i ; [L35] int t3_i ; [L36] int M_E = 2; [L37] int T1_E = 2; [L38] int T2_E = 2; [L39] int T3_E = 2; [L40] int E_M = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L49] int token ; [L51] int local ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L735] int __retres1 ; [L739] CALL init_model() [L648] m_i = 1 [L649] t1_i = 1 [L650] t2_i = 1 [L651] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L739] RET init_model() [L740] CALL start_simulation() [L676] int kernel_st ; [L677] int tmp ; [L678] int tmp___0 ; [L682] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L683] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] CALL init_threads() [L304] COND TRUE m_i == 1 [L305] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L309] COND TRUE t1_i == 1 [L310] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L314] COND TRUE t2_i == 1 [L315] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L319] COND TRUE t3_i == 1 [L320] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] RET init_threads() [L685] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L441] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L446] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L451] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L456] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L461] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L466] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L471] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L476] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L685] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L686] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L220] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L230] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L232] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L239] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L249] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L251] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L258] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L268] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L270] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L277] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L287] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L289] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L686] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L687] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L489] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L494] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L499] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L504] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L509] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L514] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L519] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L524] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L687] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L690] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L693] kernel_st = 1 [L694] CALL eval() [L360] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L355] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE \read(tmp_ndt_2) [L393] t1_st = 1 [L394] CALL transmit1() [L112] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L123] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] RET transmit1() [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE \read(tmp_ndt_3) [L407] t2_st = 1 [L408] CALL transmit2() [L148] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L159] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] RET transmit2() [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp_ndt_4) [L421] t3_st = 1 [L422] CALL transmit3() [L184] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L195] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L422] RET transmit3() [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L355] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L380] CALL master() [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L67] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L70] token = __VERIFIER_nondet_int() [L71] local = token [L72] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L73] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L581] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L220] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L230] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L239] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L240] COND TRUE E_1 == 1 [L241] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND TRUE \read(tmp___0) [L552] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L258] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L259] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L268] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L277] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L278] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L287] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L289] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L581] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L73] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L74] E_1 = 2 [L75] m_pc = 1 [L76] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L380] RET master() [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE \read(tmp_ndt_2) [L393] t1_st = 1 [L394] CALL transmit1() [L112] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L115] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L131] token += 1 [L132] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L133] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L581] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L220] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L221] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L230] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L239] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L240] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L249] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L258] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L259] COND TRUE E_2 == 1 [L260] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND TRUE \read(tmp___1) [L560] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L277] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L278] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L287] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L289] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L581] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L133] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L134] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L123] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] RET transmit1() [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE \read(tmp_ndt_3) [L407] t2_st = 1 [L408] CALL transmit2() [L148] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L151] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L167] token += 1 [L168] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L169] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L581] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L220] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L221] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L230] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L239] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L240] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L249] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L258] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L259] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L268] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L277] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L278] COND TRUE E_3 == 1 [L279] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L289] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=1, __retres1=1, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND TRUE \read(tmp___2) [L568] t3_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L581] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L169] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L170] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L159] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] RET transmit2() [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp_ndt_4) [L421] t3_st = 1 [L422] CALL transmit3() [L184] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L187] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L203] token += 1 [L204] E_M = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L205] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L581] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L220] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L221] COND TRUE E_M == 1 [L222] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND TRUE \read(tmp) [L544] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L239] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L240] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L249] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L258] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L259] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L268] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L277] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L278] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L287] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L289] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L581] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L205] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L206] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L195] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L422] RET transmit3() [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, tmp_ndt_4=1, token=3] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L355] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, tmp_ndt_4=1, token=3] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, tmp_ndt_4=1, token=3] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L380] CALL master() [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L59] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L81] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L86] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L92] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L93] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L94] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L95] CALL error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L20] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 734]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 166 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 140.9s, OverallIterations: 41, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 4.9s, AutomataDifference: 43.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11553 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11302 mSDsluCounter, 26124 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14098 mSDsCounter, 1032 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10652 IncrementalHoareTripleChecker+Invalid, 11684 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1032 mSolverCounterUnsat, 12026 mSDtfsCounter, 10652 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5929 GetRequests, 5605 SyntacticMatches, 8 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211884occurred in iteration=21, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 68.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 138402 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 11583 NumberOfCodeBlocks, 11583 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 11229 ConstructedInterpolants, 0 QuantifiedInterpolants, 18637 SizeOfPredicates, 12 NumberOfNonLiveVariables, 16331 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 67 InterpolantComputations, 40 PerfectInterpolantSequences, 5773/6839 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-16 04:24:11,739 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...