/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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 02:28:18,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 02:28:18,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 02:28:19,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 02:28:19,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 02:28:19,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 02:28:19,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 02:28:19,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 02:28:19,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 02:28:19,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 02:28:19,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 02:28:19,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 02:28:19,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 02:28:19,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 02:28:19,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 02:28:19,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 02:28:19,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 02:28:19,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 02:28:19,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 02:28:19,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 02:28:19,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 02:28:19,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 02:28:19,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 02:28:19,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 02:28:19,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 02:28:19,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 02:28:19,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 02:28:19,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 02:28:19,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 02:28:19,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 02:28:19,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 02:28:19,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 02:28:19,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 02:28:19,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 02:28:19,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 02:28:19,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 02:28:19,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 02:28:19,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 02:28:19,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 02:28:19,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 02:28:19,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 02:28:19,140 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 02:28:19,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 02:28:19,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 02:28:19,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 02:28:19,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 02:28:19,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 02:28:19,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 02:28:19,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 02:28:19,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 02:28:19,202 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 02:28:19,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 02:28:19,202 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 02:28:19,203 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 02:28:19,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 02:28:19,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 02:28:19,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 02:28:19,204 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 02:28:19,204 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 02:28:19,204 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 02:28:19,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 02:28:19,205 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 02:28:19,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 02:28:19,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 02:28:19,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 02:28:19,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 02:28:19,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 02:28:19,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 02:28:19,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 02:28:19,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 02:28:19,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 02:28:19,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 02:28:19,207 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 02:28:19,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 02:28:19,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 02:28:19,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 02:28:19,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 02:28:19,616 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 02:28:19,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-10-16 02:28:19,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a39bd8d/16f0bdf1a1a142528abf099946898eb8/FLAGe3308cfff [2022-10-16 02:28:20,349 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 02:28:20,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-10-16 02:28:20,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a39bd8d/16f0bdf1a1a142528abf099946898eb8/FLAGe3308cfff [2022-10-16 02:28:20,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a39bd8d/16f0bdf1a1a142528abf099946898eb8 [2022-10-16 02:28:20,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 02:28:20,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 02:28:20,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 02:28:20,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 02:28:20,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 02:28:20,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:28:20" (1/1) ... [2022-10-16 02:28:20,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5358ea87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:20, skipping insertion in model container [2022-10-16 02:28:20,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:28:20" (1/1) ... [2022-10-16 02:28:20,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 02:28:20,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 02:28:21,021 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-10-16 02:28:21,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 02:28:21,041 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 02:28:21,156 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-10-16 02:28:21,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 02:28:21,186 INFO L208 MainTranslator]: Completed translation [2022-10-16 02:28:21,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21 WrapperNode [2022-10-16 02:28:21,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 02:28:21,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 02:28:21,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 02:28:21,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 02:28:21,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,315 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 538 [2022-10-16 02:28:21,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 02:28:21,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 02:28:21,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 02:28:21,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 02:28:21,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,402 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 02:28:21,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 02:28:21,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 02:28:21,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 02:28:21,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (1/1) ... [2022-10-16 02:28:21,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 02:28:21,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:28:21,468 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 02:28:21,494 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 02:28:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-10-16 02:28:21,567 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-10-16 02:28:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 02:28:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-10-16 02:28:21,568 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-10-16 02:28:21,568 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-10-16 02:28:21,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-10-16 02:28:21,569 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-10-16 02:28:21,569 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-10-16 02:28:21,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 02:28:21,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 02:28:21,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 02:28:21,572 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-10-16 02:28:21,572 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-10-16 02:28:21,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 02:28:21,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 02:28:21,573 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-10-16 02:28:21,573 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-10-16 02:28:21,700 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 02:28:21,703 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 02:28:22,456 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 02:28:22,473 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 02:28:22,474 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 02:28:22,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:28:22 BoogieIcfgContainer [2022-10-16 02:28:22,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 02:28:22,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 02:28:22,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 02:28:22,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 02:28:22,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:28:20" (1/3) ... [2022-10-16 02:28:22,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11beecbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:28:22, skipping insertion in model container [2022-10-16 02:28:22,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:28:21" (2/3) ... [2022-10-16 02:28:22,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11beecbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:28:22, skipping insertion in model container [2022-10-16 02:28:22,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:28:22" (3/3) ... [2022-10-16 02:28:22,489 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-10-16 02:28:22,519 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 02:28:22,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-16 02:28:22,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 02:28:22,601 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;@51bf2685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 02:28:22,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-16 02:28:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 167 states have (on average 1.5568862275449102) internal successors, (260), 169 states have internal predecessors, (260), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-10-16 02:28:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 02:28:22,618 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:22,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:22,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1295866508, now seen corresponding path program 1 times [2022-10-16 02:28:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:22,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504140531] [2022-10-16 02:28:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:22,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:22,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-16 02:28:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:22,901 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 02:28:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504140531] [2022-10-16 02:28:22,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504140531] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:22,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:22,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 02:28:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304303535] [2022-10-16 02:28:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:22,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 02:28:22,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:22,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 02:28:22,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 02:28:22,979 INFO L87 Difference]: Start difference. First operand has 208 states, 167 states have (on average 1.5568862275449102) internal successors, (260), 169 states have internal predecessors, (260), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:28:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:23,063 INFO L93 Difference]: Finished difference Result 208 states and 313 transitions. [2022-10-16 02:28:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 02:28:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-16 02:28:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:23,088 INFO L225 Difference]: With dead ends: 208 [2022-10-16 02:28:23,089 INFO L226 Difference]: Without dead ends: 206 [2022-10-16 02:28:23,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 02:28:23,099 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:23,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-16 02:28:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-10-16 02:28:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 166 states have (on average 1.5) internal successors, (249), 167 states have internal predecessors, (249), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-10-16 02:28:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions. [2022-10-16 02:28:23,220 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 13 [2022-10-16 02:28:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:23,221 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 311 transitions. [2022-10-16 02:28:23,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:28:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions. [2022-10-16 02:28:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 02:28:23,224 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:23,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:23,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 02:28:23,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash 478712248, now seen corresponding path program 1 times [2022-10-16 02:28:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:23,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156022905] [2022-10-16 02:28:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-16 02:28:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:23,506 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 02:28:23,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:23,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156022905] [2022-10-16 02:28:23,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156022905] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:23,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:23,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 02:28:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922643734] [2022-10-16 02:28:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:23,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 02:28:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:23,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 02:28:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 02:28:23,514 INFO L87 Difference]: Start difference. First operand 206 states and 311 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:28:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:23,655 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2022-10-16 02:28:23,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 02:28:23,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-16 02:28:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:23,660 INFO L225 Difference]: With dead ends: 347 [2022-10-16 02:28:23,660 INFO L226 Difference]: Without dead ends: 345 [2022-10-16 02:28:23,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 02:28:23,663 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 171 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:23,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1598 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-10-16 02:28:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 207. [2022-10-16 02:28:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.4251497005988023) internal successors, (238), 168 states have internal predecessors, (238), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-10-16 02:28:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 300 transitions. [2022-10-16 02:28:23,706 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 300 transitions. Word has length 13 [2022-10-16 02:28:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:23,707 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 300 transitions. [2022-10-16 02:28:23,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:28:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 300 transitions. [2022-10-16 02:28:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 02:28:23,711 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:23,712 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] [2022-10-16 02:28:23,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 02:28:23,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash -193704208, now seen corresponding path program 1 times [2022-10-16 02:28:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:23,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132535631] [2022-10-16 02:28:23,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,261 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 02:28:24,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:24,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132535631] [2022-10-16 02:28:24,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132535631] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:24,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:24,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415503737] [2022-10-16 02:28:24,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:24,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:24,267 INFO L87 Difference]: Start difference. First operand 207 states and 300 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:28:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:24,338 INFO L93 Difference]: Finished difference Result 211 states and 303 transitions. [2022-10-16 02:28:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:28:24,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-10-16 02:28:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:24,342 INFO L225 Difference]: With dead ends: 211 [2022-10-16 02:28:24,342 INFO L226 Difference]: Without dead ends: 211 [2022-10-16 02:28:24,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:24,350 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 5 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:24,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 869 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-10-16 02:28:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-10-16 02:28:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 171 states have internal predecessors, (241), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-10-16 02:28:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 303 transitions. [2022-10-16 02:28:24,385 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 303 transitions. Word has length 55 [2022-10-16 02:28:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:24,386 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 303 transitions. [2022-10-16 02:28:24,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:28:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 303 transitions. [2022-10-16 02:28:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-16 02:28:24,399 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:24,399 INFO L195 NwaCegarLoop]: trace histogram [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 02:28:24,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 02:28:24,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash 472390690, now seen corresponding path program 1 times [2022-10-16 02:28:24,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:24,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565895542] [2022-10-16 02:28:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 02:28:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:24,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:24,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565895542] [2022-10-16 02:28:24,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565895542] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:24,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:24,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 02:28:24,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615322351] [2022-10-16 02:28:24,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:24,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:28:24,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:24,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:28:24,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:28:24,590 INFO L87 Difference]: Start difference. First operand 211 states and 303 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:24,633 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2022-10-16 02:28:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:28:24,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-10-16 02:28:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:24,642 INFO L225 Difference]: With dead ends: 381 [2022-10-16 02:28:24,642 INFO L226 Difference]: Without dead ends: 381 [2022-10-16 02:28:24,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:28:24,654 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 230 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:24,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 628 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-10-16 02:28:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 368. [2022-10-16 02:28:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 290 states have (on average 1.4379310344827587) internal successors, (417), 292 states have internal predecessors, (417), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-10-16 02:28:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 537 transitions. [2022-10-16 02:28:24,687 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 537 transitions. Word has length 71 [2022-10-16 02:28:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:24,689 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 537 transitions. [2022-10-16 02:28:24,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 537 transitions. [2022-10-16 02:28:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 02:28:24,692 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:24,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:24,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 02:28:24,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1468710038, now seen corresponding path program 1 times [2022-10-16 02:28:24,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:24,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645561473] [2022-10-16 02:28:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 02:28:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:24,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:24,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645561473] [2022-10-16 02:28:24,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645561473] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:24,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:24,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 02:28:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011313921] [2022-10-16 02:28:24,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:24,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:28:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:28:24,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:28:24,924 INFO L87 Difference]: Start difference. First operand 368 states and 537 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:24,975 INFO L93 Difference]: Finished difference Result 669 states and 983 transitions. [2022-10-16 02:28:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:28:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2022-10-16 02:28:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:24,985 INFO L225 Difference]: With dead ends: 669 [2022-10-16 02:28:24,985 INFO L226 Difference]: Without dead ends: 669 [2022-10-16 02:28:24,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:28:24,987 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 238 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:24,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 663 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-10-16 02:28:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 649. [2022-10-16 02:28:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 499 states have (on average 1.4589178356713426) internal successors, (728), 503 states have internal predecessors, (728), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2022-10-16 02:28:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 962 transitions. [2022-10-16 02:28:25,049 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 962 transitions. Word has length 72 [2022-10-16 02:28:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:25,051 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 962 transitions. [2022-10-16 02:28:25,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 962 transitions. [2022-10-16 02:28:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 02:28:25,055 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:25,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:25,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 02:28:25,056 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1546393580, now seen corresponding path program 1 times [2022-10-16 02:28:25,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:25,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135183759] [2022-10-16 02:28:25,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:25,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:25,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 02:28:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:25,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135183759] [2022-10-16 02:28:25,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135183759] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:25,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:25,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 02:28:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242038454] [2022-10-16 02:28:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:25,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 02:28:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 02:28:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:25,340 INFO L87 Difference]: Start difference. First operand 649 states and 962 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:25,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:25,693 INFO L93 Difference]: Finished difference Result 1183 states and 1784 transitions. [2022-10-16 02:28:25,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 02:28:25,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2022-10-16 02:28:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:25,710 INFO L225 Difference]: With dead ends: 1183 [2022-10-16 02:28:25,711 INFO L226 Difference]: Without dead ends: 1183 [2022-10-16 02:28:25,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 02:28:25,713 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 795 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:25,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 787 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 02:28:25,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-10-16 02:28:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 773. [2022-10-16 02:28:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 610 states have (on average 1.437704918032787) internal successors, (877), 614 states have internal predecessors, (877), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:28:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1125 transitions. [2022-10-16 02:28:25,764 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1125 transitions. Word has length 72 [2022-10-16 02:28:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:25,765 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1125 transitions. [2022-10-16 02:28:25,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1125 transitions. [2022-10-16 02:28:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-16 02:28:25,767 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:25,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:25,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 02:28:25,768 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:25,768 INFO L85 PathProgramCache]: Analyzing trace with hash -452921983, now seen corresponding path program 1 times [2022-10-16 02:28:25,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:25,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578586173] [2022-10-16 02:28:25,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:25,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:25,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:25,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 02:28:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:25,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:25,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578586173] [2022-10-16 02:28:25,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578586173] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:25,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:25,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 02:28:25,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778141246] [2022-10-16 02:28:25,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:25,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 02:28:25,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:25,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 02:28:25,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:25,953 INFO L87 Difference]: Start difference. First operand 773 states and 1125 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:26,262 INFO L93 Difference]: Finished difference Result 1187 states and 1784 transitions. [2022-10-16 02:28:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 02:28:26,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2022-10-16 02:28:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:26,272 INFO L225 Difference]: With dead ends: 1187 [2022-10-16 02:28:26,272 INFO L226 Difference]: Without dead ends: 1187 [2022-10-16 02:28:26,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 02:28:26,275 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 792 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:26,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 789 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:28:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-10-16 02:28:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 781. [2022-10-16 02:28:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 618 states have (on average 1.4320388349514563) internal successors, (885), 622 states have internal predecessors, (885), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:28:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1133 transitions. [2022-10-16 02:28:26,329 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1133 transitions. Word has length 73 [2022-10-16 02:28:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:26,330 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1133 transitions. [2022-10-16 02:28:26,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1133 transitions. [2022-10-16 02:28:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-10-16 02:28:26,332 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:26,332 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 02:28:26,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 02:28:26,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1195119283, now seen corresponding path program 1 times [2022-10-16 02:28:26,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:26,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390946692] [2022-10-16 02:28:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:26,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 02:28:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:26,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:26,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390946692] [2022-10-16 02:28:26,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390946692] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:26,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:26,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:26,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610242830] [2022-10-16 02:28:26,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:26,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:26,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:26,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:26,528 INFO L87 Difference]: Start difference. First operand 781 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:26,812 INFO L93 Difference]: Finished difference Result 1187 states and 1780 transitions. [2022-10-16 02:28:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:28:26,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 75 [2022-10-16 02:28:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:26,821 INFO L225 Difference]: With dead ends: 1187 [2022-10-16 02:28:26,821 INFO L226 Difference]: Without dead ends: 1187 [2022-10-16 02:28:26,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:26,822 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 241 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:26,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 756 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:28:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-10-16 02:28:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 781. [2022-10-16 02:28:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 618 states have (on average 1.4255663430420713) internal successors, (881), 622 states have internal predecessors, (881), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:28:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1129 transitions. [2022-10-16 02:28:26,862 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1129 transitions. Word has length 75 [2022-10-16 02:28:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:26,862 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1129 transitions. [2022-10-16 02:28:26,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-16 02:28:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1129 transitions. [2022-10-16 02:28:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 02:28:26,864 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:26,864 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 02:28:26,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 02:28:26,865 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:26,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash -975230790, now seen corresponding path program 1 times [2022-10-16 02:28:26,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:26,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769158532] [2022-10-16 02:28:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:27,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:27,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769158532] [2022-10-16 02:28:27,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769158532] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:27,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:27,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060009128] [2022-10-16 02:28:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:27,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:27,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:27,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:27,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:27,104 INFO L87 Difference]: Start difference. First operand 781 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 02:28:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:27,135 INFO L93 Difference]: Finished difference Result 801 states and 1145 transitions. [2022-10-16 02:28:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:28:27,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2022-10-16 02:28:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:27,141 INFO L225 Difference]: With dead ends: 801 [2022-10-16 02:28:27,141 INFO L226 Difference]: Without dead ends: 801 [2022-10-16 02:28:27,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:27,143 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 6 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:27,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 881 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-10-16 02:28:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2022-10-16 02:28:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 634 states have (on average 1.414826498422713) internal successors, (897), 638 states have internal predecessors, (897), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:28:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1145 transitions. [2022-10-16 02:28:27,173 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1145 transitions. Word has length 76 [2022-10-16 02:28:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:27,174 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1145 transitions. [2022-10-16 02:28:27,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 02:28:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1145 transitions. [2022-10-16 02:28:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-16 02:28:27,176 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:27,176 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 02:28:27,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 02:28:27,177 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:27,177 INFO L85 PathProgramCache]: Analyzing trace with hash 830484384, now seen corresponding path program 1 times [2022-10-16 02:28:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:27,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151799810] [2022-10-16 02:28:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:27,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:27,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151799810] [2022-10-16 02:28:27,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151799810] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:27,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:27,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087878298] [2022-10-16 02:28:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:27,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:27,435 INFO L87 Difference]: Start difference. First operand 801 states and 1145 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 02:28:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:27,482 INFO L93 Difference]: Finished difference Result 821 states and 1161 transitions. [2022-10-16 02:28:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:28:27,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 84 [2022-10-16 02:28:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:27,488 INFO L225 Difference]: With dead ends: 821 [2022-10-16 02:28:27,488 INFO L226 Difference]: Without dead ends: 821 [2022-10-16 02:28:27,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:27,489 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:27,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 867 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-10-16 02:28:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2022-10-16 02:28:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 650 states have (on average 1.4046153846153846) internal successors, (913), 654 states have internal predecessors, (913), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:28:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1161 transitions. [2022-10-16 02:28:27,517 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1161 transitions. Word has length 84 [2022-10-16 02:28:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:27,518 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1161 transitions. [2022-10-16 02:28:27,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 02:28:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1161 transitions. [2022-10-16 02:28:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 02:28:27,520 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:27,520 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 02:28:27,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 02:28:27,521 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash 54736682, now seen corresponding path program 1 times [2022-10-16 02:28:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:27,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246519440] [2022-10-16 02:28:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:27,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:27,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:27,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246519440] [2022-10-16 02:28:27,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246519440] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:27,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:27,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968977189] [2022-10-16 02:28:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:27,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:27,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:27,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:27,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:27,729 INFO L87 Difference]: Start difference. First operand 821 states and 1161 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 02:28:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:27,767 INFO L93 Difference]: Finished difference Result 837 states and 1173 transitions. [2022-10-16 02:28:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:28:27,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-10-16 02:28:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:27,775 INFO L225 Difference]: With dead ends: 837 [2022-10-16 02:28:27,775 INFO L226 Difference]: Without dead ends: 837 [2022-10-16 02:28:27,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:27,776 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 5 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:27,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 876 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-10-16 02:28:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2022-10-16 02:28:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 662 states have (on average 1.3972809667673716) internal successors, (925), 666 states have internal predecessors, (925), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:28:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1173 transitions. [2022-10-16 02:28:27,846 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1173 transitions. Word has length 92 [2022-10-16 02:28:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:27,847 INFO L495 AbstractCegarLoop]: Abstraction has 837 states and 1173 transitions. [2022-10-16 02:28:27,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 02:28:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1173 transitions. [2022-10-16 02:28:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 02:28:27,850 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:27,850 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 02:28:27,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 02:28:27,851 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:27,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:27,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1843771311, now seen corresponding path program 1 times [2022-10-16 02:28:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:27,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668487792] [2022-10-16 02:28:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:27,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:28:28,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:28,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668487792] [2022-10-16 02:28:28,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668487792] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:28,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:28,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174074497] [2022-10-16 02:28:28,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:28,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:28,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:28,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:28,110 INFO L87 Difference]: Start difference. First operand 837 states and 1173 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 02:28:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:28,155 INFO L93 Difference]: Finished difference Result 857 states and 1189 transitions. [2022-10-16 02:28:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:28:28,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2022-10-16 02:28:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:28,162 INFO L225 Difference]: With dead ends: 857 [2022-10-16 02:28:28,162 INFO L226 Difference]: Without dead ends: 857 [2022-10-16 02:28:28,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:28,163 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:28,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 867 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-10-16 02:28:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2022-10-16 02:28:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 678 states have (on average 1.387905604719764) internal successors, (941), 682 states have internal predecessors, (941), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:28:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1189 transitions. [2022-10-16 02:28:28,193 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1189 transitions. Word has length 92 [2022-10-16 02:28:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:28,194 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1189 transitions. [2022-10-16 02:28:28,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 02:28:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1189 transitions. [2022-10-16 02:28:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-16 02:28:28,197 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:28,197 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 02:28:28,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 02:28:28,197 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2072879375, now seen corresponding path program 1 times [2022-10-16 02:28:28,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:28,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920743758] [2022-10-16 02:28:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:28,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 02:28:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:28,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920743758] [2022-10-16 02:28:28,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920743758] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:28,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:28,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:28,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505398904] [2022-10-16 02:28:28,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:28,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:28,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:28,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:28,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:28,508 INFO L87 Difference]: Start difference. First operand 857 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 02:28:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:28,545 INFO L93 Difference]: Finished difference Result 881 states and 1209 transitions. [2022-10-16 02:28:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:28:28,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 100 [2022-10-16 02:28:28,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:28,551 INFO L225 Difference]: With dead ends: 881 [2022-10-16 02:28:28,551 INFO L226 Difference]: Without dead ends: 881 [2022-10-16 02:28:28,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:28,553 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 7 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:28,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 878 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-10-16 02:28:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-10-16 02:28:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 698 states have (on average 1.3767908309455588) internal successors, (961), 702 states have internal predecessors, (961), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:28:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1209 transitions. [2022-10-16 02:28:28,586 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1209 transitions. Word has length 100 [2022-10-16 02:28:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:28,587 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1209 transitions. [2022-10-16 02:28:28,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 02:28:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1209 transitions. [2022-10-16 02:28:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-10-16 02:28:28,590 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:28,590 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-10-16 02:28:28,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 02:28:28,590 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash 366508276, now seen corresponding path program 1 times [2022-10-16 02:28:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:28,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625935852] [2022-10-16 02:28:28,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:28,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:28:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 02:28:29,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:29,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625935852] [2022-10-16 02:28:29,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625935852] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:29,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:29,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:28:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208759624] [2022-10-16 02:28:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:29,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:28:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:29,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:28:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:28:29,019 INFO L87 Difference]: Start difference. First operand 881 states and 1209 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 02:28:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:29,331 INFO L93 Difference]: Finished difference Result 1783 states and 2480 transitions. [2022-10-16 02:28:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 02:28:29,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 103 [2022-10-16 02:28:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:29,343 INFO L225 Difference]: With dead ends: 1783 [2022-10-16 02:28:29,344 INFO L226 Difference]: Without dead ends: 1783 [2022-10-16 02:28:29,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-16 02:28:29,345 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 404 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:29,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 2361 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:28:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-10-16 02:28:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1165. [2022-10-16 02:28:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 909 states have (on average 1.3674367436743675) internal successors, (1243), 915 states have internal predecessors, (1243), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-10-16 02:28:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1587 transitions. [2022-10-16 02:28:29,404 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1587 transitions. Word has length 103 [2022-10-16 02:28:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:29,405 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1587 transitions. [2022-10-16 02:28:29,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 02:28:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1587 transitions. [2022-10-16 02:28:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-16 02:28:29,407 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:29,408 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-10-16 02:28:29,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 02:28:29,408 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1104864554, now seen corresponding path program 1 times [2022-10-16 02:28:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:29,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57655547] [2022-10-16 02:28:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:28:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 02:28:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:29,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57655547] [2022-10-16 02:28:29,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57655547] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:29,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:29,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:29,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430448147] [2022-10-16 02:28:29,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:29,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:29,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:29,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:29,640 INFO L87 Difference]: Start difference. First operand 1165 states and 1587 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 02:28:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:29,680 INFO L93 Difference]: Finished difference Result 1189 states and 1605 transitions. [2022-10-16 02:28:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:28:29,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 107 [2022-10-16 02:28:29,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:29,688 INFO L225 Difference]: With dead ends: 1189 [2022-10-16 02:28:29,688 INFO L226 Difference]: Without dead ends: 1189 [2022-10-16 02:28:29,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:29,690 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 5 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:29,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 876 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-10-16 02:28:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1189. [2022-10-16 02:28:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 927 states have (on average 1.360302049622438) internal successors, (1261), 933 states have internal predecessors, (1261), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-10-16 02:28:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1605 transitions. [2022-10-16 02:28:29,736 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1605 transitions. Word has length 107 [2022-10-16 02:28:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:29,737 INFO L495 AbstractCegarLoop]: Abstraction has 1189 states and 1605 transitions. [2022-10-16 02:28:29,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 02:28:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1605 transitions. [2022-10-16 02:28:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-16 02:28:29,739 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:29,740 INFO L195 NwaCegarLoop]: trace histogram [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 02:28:29,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 02:28:29,740 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1182683350, now seen corresponding path program 1 times [2022-10-16 02:28:29,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:29,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745190397] [2022-10-16 02:28:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:28:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-16 02:28:30,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:30,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745190397] [2022-10-16 02:28:30,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745190397] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:30,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:30,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 02:28:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868883667] [2022-10-16 02:28:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:30,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 02:28:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 02:28:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 02:28:30,136 INFO L87 Difference]: Start difference. First operand 1189 states and 1605 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 02:28:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:30,247 INFO L93 Difference]: Finished difference Result 1663 states and 2348 transitions. [2022-10-16 02:28:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 02:28:30,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 106 [2022-10-16 02:28:30,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:30,258 INFO L225 Difference]: With dead ends: 1663 [2022-10-16 02:28:30,258 INFO L226 Difference]: Without dead ends: 1663 [2022-10-16 02:28:30,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 02:28:30,259 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 269 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:30,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2283 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2022-10-16 02:28:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1197. [2022-10-16 02:28:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 931 states have (on average 1.3587540279269603) internal successors, (1265), 939 states have internal predecessors, (1265), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-10-16 02:28:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1613 transitions. [2022-10-16 02:28:30,313 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1613 transitions. Word has length 106 [2022-10-16 02:28:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:30,313 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 1613 transitions. [2022-10-16 02:28:30,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 02:28:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1613 transitions. [2022-10-16 02:28:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-10-16 02:28:30,316 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:30,316 INFO L195 NwaCegarLoop]: trace histogram [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 02:28:30,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 02:28:30,316 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1514211131, now seen corresponding path program 1 times [2022-10-16 02:28:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:30,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123407865] [2022-10-16 02:28:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:28:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-16 02:28:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:30,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123407865] [2022-10-16 02:28:30,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123407865] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:30,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:30,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:28:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333421067] [2022-10-16 02:28:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:30,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:28:30,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:30,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:28:30,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:28:30,570 INFO L87 Difference]: Start difference. First operand 1197 states and 1613 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 02:28:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:30,767 INFO L93 Difference]: Finished difference Result 1574 states and 2161 transitions. [2022-10-16 02:28:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 02:28:30,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 109 [2022-10-16 02:28:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:30,776 INFO L225 Difference]: With dead ends: 1574 [2022-10-16 02:28:30,777 INFO L226 Difference]: Without dead ends: 1574 [2022-10-16 02:28:30,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-16 02:28:30,778 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 536 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:30,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2308 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-10-16 02:28:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1243. [2022-10-16 02:28:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 988 states have (on average 1.3502024291497976) internal successors, (1334), 1001 states have internal predecessors, (1334), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2022-10-16 02:28:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1658 transitions. [2022-10-16 02:28:30,837 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1658 transitions. Word has length 109 [2022-10-16 02:28:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:30,837 INFO L495 AbstractCegarLoop]: Abstraction has 1243 states and 1658 transitions. [2022-10-16 02:28:30,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 02:28:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1658 transitions. [2022-10-16 02:28:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-10-16 02:28:30,840 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:30,840 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-10-16 02:28:30,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 02:28:30,841 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:30,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash 11969658, now seen corresponding path program 1 times [2022-10-16 02:28:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:30,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537875425] [2022-10-16 02:28:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:30,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:28:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:28:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-16 02:28:31,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:31,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537875425] [2022-10-16 02:28:31,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537875425] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:31,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:31,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:28:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657939760] [2022-10-16 02:28:31,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:31,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:28:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:28:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:28:31,265 INFO L87 Difference]: Start difference. First operand 1243 states and 1658 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 02:28:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:31,456 INFO L93 Difference]: Finished difference Result 1602 states and 2195 transitions. [2022-10-16 02:28:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 02:28:31,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 111 [2022-10-16 02:28:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:31,466 INFO L225 Difference]: With dead ends: 1602 [2022-10-16 02:28:31,466 INFO L226 Difference]: Without dead ends: 1602 [2022-10-16 02:28:31,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-16 02:28:31,467 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 408 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:31,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 2458 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-10-16 02:28:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1129. [2022-10-16 02:28:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 901 states have (on average 1.3507214206437292) internal successors, (1217), 912 states have internal predecessors, (1217), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2022-10-16 02:28:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1507 transitions. [2022-10-16 02:28:31,510 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1507 transitions. Word has length 111 [2022-10-16 02:28:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:31,511 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1507 transitions. [2022-10-16 02:28:31,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 02:28:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1507 transitions. [2022-10-16 02:28:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-10-16 02:28:31,513 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:31,513 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:31,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 02:28:31,513 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:31,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1764588103, now seen corresponding path program 1 times [2022-10-16 02:28:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:31,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463171406] [2022-10-16 02:28:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:28:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:28:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 02:28:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:31,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463171406] [2022-10-16 02:28:31,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463171406] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:31,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:31,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 02:28:31,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415178762] [2022-10-16 02:28:31,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:31,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 02:28:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:31,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 02:28:31,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 02:28:31,957 INFO L87 Difference]: Start difference. First operand 1129 states and 1507 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 02:28:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:32,634 INFO L93 Difference]: Finished difference Result 1707 states and 2345 transitions. [2022-10-16 02:28:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 02:28:32,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 112 [2022-10-16 02:28:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:32,645 INFO L225 Difference]: With dead ends: 1707 [2022-10-16 02:28:32,645 INFO L226 Difference]: Without dead ends: 1707 [2022-10-16 02:28:32,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-10-16 02:28:32,647 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 1067 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:32,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 2204 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 02:28:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-10-16 02:28:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1145. [2022-10-16 02:28:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 909 states have (on average 1.331133113311331) internal successors, (1210), 921 states have internal predecessors, (1210), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2022-10-16 02:28:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1506 transitions. [2022-10-16 02:28:32,707 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1506 transitions. Word has length 112 [2022-10-16 02:28:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:32,708 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1506 transitions. [2022-10-16 02:28:32,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 02:28:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1506 transitions. [2022-10-16 02:28:32,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-10-16 02:28:32,710 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:32,711 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-10-16 02:28:32,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 02:28:32,711 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash 775360161, now seen corresponding path program 1 times [2022-10-16 02:28:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:32,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659300266] [2022-10-16 02:28:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:32,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:28:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-16 02:28:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-16 02:28:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:32,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659300266] [2022-10-16 02:28:32,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659300266] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:28:32,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557515552] [2022-10-16 02:28:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:28:32,947 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 02:28:32,963 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 02:28:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 02:28:33,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:28:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 02:28:33,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 02:28:33,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557515552] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:33,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 02:28:33,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-16 02:28:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441440105] [2022-10-16 02:28:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:33,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:28:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:33,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:28:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:33,331 INFO L87 Difference]: Start difference. First operand 1145 states and 1506 transitions. Second operand has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-16 02:28:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:33,402 INFO L93 Difference]: Finished difference Result 1144 states and 1505 transitions. [2022-10-16 02:28:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:28:33,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 111 [2022-10-16 02:28:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:33,412 INFO L225 Difference]: With dead ends: 1144 [2022-10-16 02:28:33,413 INFO L226 Difference]: Without dead ends: 1142 [2022-10-16 02:28:33,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:33,414 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 122 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:33,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-10-16 02:28:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2022-10-16 02:28:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 907 states have (on average 1.328555678059537) internal successors, (1205), 918 states have internal predecessors, (1205), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2022-10-16 02:28:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1501 transitions. [2022-10-16 02:28:33,474 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1501 transitions. Word has length 111 [2022-10-16 02:28:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:33,475 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1501 transitions. [2022-10-16 02:28:33,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 43.0) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-16 02:28:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1501 transitions. [2022-10-16 02:28:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-10-16 02:28:33,478 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:33,479 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:33,547 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 02:28:33,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:33,693 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:33,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1302260882, now seen corresponding path program 1 times [2022-10-16 02:28:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:33,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918190070] [2022-10-16 02:28:33,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:28:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:28:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:28:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:33,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918190070] [2022-10-16 02:28:33,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918190070] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:33,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:33,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492750217] [2022-10-16 02:28:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:33,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:33,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:33,881 INFO L87 Difference]: Start difference. First operand 1142 states and 1501 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:34,083 INFO L93 Difference]: Finished difference Result 2296 states and 3055 transitions. [2022-10-16 02:28:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:28:34,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2022-10-16 02:28:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:34,098 INFO L225 Difference]: With dead ends: 2296 [2022-10-16 02:28:34,098 INFO L226 Difference]: Without dead ends: 2296 [2022-10-16 02:28:34,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:34,099 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 440 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:34,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1227 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:28:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-10-16 02:28:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1939. [2022-10-16 02:28:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1514 states have (on average 1.3262879788639366) internal successors, (2008), 1533 states have internal predecessors, (2008), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2022-10-16 02:28:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2552 transitions. [2022-10-16 02:28:34,227 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2552 transitions. Word has length 112 [2022-10-16 02:28:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:34,227 INFO L495 AbstractCegarLoop]: Abstraction has 1939 states and 2552 transitions. [2022-10-16 02:28:34,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2552 transitions. [2022-10-16 02:28:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-10-16 02:28:34,232 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:34,232 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:34,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 02:28:34,233 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash -952412061, now seen corresponding path program 1 times [2022-10-16 02:28:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:34,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727793021] [2022-10-16 02:28:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:28:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:28:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 02:28:34,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:34,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727793021] [2022-10-16 02:28:34,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727793021] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:34,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:34,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:28:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268564008] [2022-10-16 02:28:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:34,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:28:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:34,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:28:34,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:28:34,718 INFO L87 Difference]: Start difference. First operand 1939 states and 2552 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:35,362 INFO L93 Difference]: Finished difference Result 2810 states and 3798 transitions. [2022-10-16 02:28:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 02:28:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2022-10-16 02:28:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:35,391 INFO L225 Difference]: With dead ends: 2810 [2022-10-16 02:28:35,391 INFO L226 Difference]: Without dead ends: 2810 [2022-10-16 02:28:35,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-10-16 02:28:35,393 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 806 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:35,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2518 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 02:28:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-10-16 02:28:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1958. [2022-10-16 02:28:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1520 states have (on average 1.3223684210526316) internal successors, (2010), 1540 states have internal predecessors, (2010), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2022-10-16 02:28:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2570 transitions. [2022-10-16 02:28:35,497 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2570 transitions. Word has length 114 [2022-10-16 02:28:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:35,498 INFO L495 AbstractCegarLoop]: Abstraction has 1958 states and 2570 transitions. [2022-10-16 02:28:35,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2570 transitions. [2022-10-16 02:28:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-16 02:28:35,502 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:35,502 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:35,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 02:28:35,503 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 261211168, now seen corresponding path program 1 times [2022-10-16 02:28:35,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:35,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710160865] [2022-10-16 02:28:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:35,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 02:28:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:28:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:28:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:28:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:28:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:28:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:28:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:28:35,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:35,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710160865] [2022-10-16 02:28:35,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710160865] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:35,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:35,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:35,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934597325] [2022-10-16 02:28:35,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:35,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:35,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:35,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:35,664 INFO L87 Difference]: Start difference. First operand 1958 states and 2570 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:35,859 INFO L93 Difference]: Finished difference Result 3594 states and 4750 transitions. [2022-10-16 02:28:35,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:28:35,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-10-16 02:28:35,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:35,876 INFO L225 Difference]: With dead ends: 3594 [2022-10-16 02:28:35,876 INFO L226 Difference]: Without dead ends: 3594 [2022-10-16 02:28:35,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:35,877 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 487 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:35,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1291 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-10-16 02:28:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3019. [2022-10-16 02:28:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2306 states have (on average 1.318733738074588) internal successors, (3041), 2337 states have internal predecessors, (3041), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2022-10-16 02:28:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3961 transitions. [2022-10-16 02:28:36,014 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3961 transitions. Word has length 115 [2022-10-16 02:28:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:36,015 INFO L495 AbstractCegarLoop]: Abstraction has 3019 states and 3961 transitions. [2022-10-16 02:28:36,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3961 transitions. [2022-10-16 02:28:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-16 02:28:36,019 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:36,020 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:36,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 02:28:36,020 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1247179632, now seen corresponding path program 1 times [2022-10-16 02:28:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:36,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059467020] [2022-10-16 02:28:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 02:28:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:28:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-16 02:28:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 02:28:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 02:28:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 02:28:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-16 02:28:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:28:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:36,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059467020] [2022-10-16 02:28:36,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059467020] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:36,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:36,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085448231] [2022-10-16 02:28:36,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:36,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:36,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:36,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:36,195 INFO L87 Difference]: Start difference. First operand 3019 states and 3961 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:36,379 INFO L93 Difference]: Finished difference Result 4635 states and 6073 transitions. [2022-10-16 02:28:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:28:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-10-16 02:28:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:36,395 INFO L225 Difference]: With dead ends: 4635 [2022-10-16 02:28:36,395 INFO L226 Difference]: Without dead ends: 4635 [2022-10-16 02:28:36,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:36,396 INFO L413 NwaCegarLoop]: 551 mSDtfsCounter, 434 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:36,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1288 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2022-10-16 02:28:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4297. [2022-10-16 02:28:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 3260 states have (on average 1.316564417177914) internal successors, (4292), 3304 states have internal predecessors, (4292), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-10-16 02:28:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5636 transitions. [2022-10-16 02:28:36,571 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5636 transitions. Word has length 115 [2022-10-16 02:28:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:36,571 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5636 transitions. [2022-10-16 02:28:36,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5636 transitions. [2022-10-16 02:28:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-16 02:28:36,575 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:36,576 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:36,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 02:28:36,576 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:36,577 INFO L85 PathProgramCache]: Analyzing trace with hash 61959464, now seen corresponding path program 1 times [2022-10-16 02:28:36,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:36,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285143447] [2022-10-16 02:28:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-16 02:28:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:28:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 02:28:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-10-16 02:28:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-16 02:28:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-16 02:28:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-16 02:28:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:28:36,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:36,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285143447] [2022-10-16 02:28:36,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285143447] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:36,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:36,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 02:28:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599716792] [2022-10-16 02:28:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:36,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:28:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:28:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:28:36,672 INFO L87 Difference]: Start difference. First operand 4297 states and 5636 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:36,818 INFO L93 Difference]: Finished difference Result 5828 states and 8046 transitions. [2022-10-16 02:28:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:28:36,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-10-16 02:28:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:36,840 INFO L225 Difference]: With dead ends: 5828 [2022-10-16 02:28:36,840 INFO L226 Difference]: Without dead ends: 5828 [2022-10-16 02:28:36,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:28:36,841 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 152 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:36,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 705 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2022-10-16 02:28:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 4303. [2022-10-16 02:28:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4303 states, 3266 states have (on average 1.3159828536436007) internal successors, (4298), 3310 states have internal predecessors, (4298), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-10-16 02:28:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 5642 transitions. [2022-10-16 02:28:37,029 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 5642 transitions. Word has length 116 [2022-10-16 02:28:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:37,029 INFO L495 AbstractCegarLoop]: Abstraction has 4303 states and 5642 transitions. [2022-10-16 02:28:37,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 5642 transitions. [2022-10-16 02:28:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-10-16 02:28:37,034 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:37,034 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:37,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-16 02:28:37,035 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:37,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:37,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1834083851, now seen corresponding path program 1 times [2022-10-16 02:28:37,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:37,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330641785] [2022-10-16 02:28:37,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:37,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 02:28:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:28:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-16 02:28:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-10-16 02:28:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 02:28:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-10-16 02:28:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-16 02:28:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:28:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:37,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330641785] [2022-10-16 02:28:37,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330641785] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:37,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:37,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47421407] [2022-10-16 02:28:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:37,269 INFO L87 Difference]: Start difference. First operand 4303 states and 5642 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:37,358 INFO L93 Difference]: Finished difference Result 4810 states and 6549 transitions. [2022-10-16 02:28:37,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:28:37,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 117 [2022-10-16 02:28:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:37,376 INFO L225 Difference]: With dead ends: 4810 [2022-10-16 02:28:37,377 INFO L226 Difference]: Without dead ends: 4810 [2022-10-16 02:28:37,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:37,378 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 370 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:37,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 884 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2022-10-16 02:28:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3870. [2022-10-16 02:28:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 2916 states have (on average 1.3223593964334706) internal successors, (3856), 2950 states have internal predecessors, (3856), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-10-16 02:28:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 5096 transitions. [2022-10-16 02:28:37,537 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 5096 transitions. Word has length 117 [2022-10-16 02:28:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:37,537 INFO L495 AbstractCegarLoop]: Abstraction has 3870 states and 5096 transitions. [2022-10-16 02:28:37,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 5096 transitions. [2022-10-16 02:28:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-10-16 02:28:37,540 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:37,540 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:37,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-16 02:28:37,541 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1831735795, now seen corresponding path program 1 times [2022-10-16 02:28:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:37,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588228554] [2022-10-16 02:28:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-16 02:28:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:28:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 02:28:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-10-16 02:28:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-16 02:28:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-16 02:28:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-16 02:28:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:28:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:37,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588228554] [2022-10-16 02:28:37,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588228554] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:37,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:37,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 02:28:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109405902] [2022-10-16 02:28:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:37,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:28:37,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:37,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:28:37,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:28:37,642 INFO L87 Difference]: Start difference. First operand 3870 states and 5096 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:37,787 INFO L93 Difference]: Finished difference Result 4861 states and 6657 transitions. [2022-10-16 02:28:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:28:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2022-10-16 02:28:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:37,806 INFO L225 Difference]: With dead ends: 4861 [2022-10-16 02:28:37,806 INFO L226 Difference]: Without dead ends: 4861 [2022-10-16 02:28:37,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:28:37,807 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 152 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:37,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 684 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2022-10-16 02:28:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3880. [2022-10-16 02:28:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 2926 states have (on average 1.3212576896787422) internal successors, (3866), 2960 states have internal predecessors, (3866), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-10-16 02:28:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 5106 transitions. [2022-10-16 02:28:37,976 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 5106 transitions. Word has length 118 [2022-10-16 02:28:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:37,976 INFO L495 AbstractCegarLoop]: Abstraction has 3880 states and 5106 transitions. [2022-10-16 02:28:37,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 5106 transitions. [2022-10-16 02:28:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-10-16 02:28:37,979 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:37,979 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:37,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-16 02:28:37,980 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:37,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1130595538, now seen corresponding path program 1 times [2022-10-16 02:28:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:37,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100708073] [2022-10-16 02:28:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-16 02:28:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:28:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-10-16 02:28:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-10-16 02:28:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-16 02:28:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-16 02:28:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-16 02:28:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:28:38,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100708073] [2022-10-16 02:28:38,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100708073] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:38,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:38,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:38,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341237510] [2022-10-16 02:28:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:38,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:38,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:38,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:38,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:38,205 INFO L87 Difference]: Start difference. First operand 3880 states and 5106 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:38,286 INFO L93 Difference]: Finished difference Result 4731 states and 6485 transitions. [2022-10-16 02:28:38,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:28:38,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 118 [2022-10-16 02:28:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:38,304 INFO L225 Difference]: With dead ends: 4731 [2022-10-16 02:28:38,304 INFO L226 Difference]: Without dead ends: 4731 [2022-10-16 02:28:38,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:38,305 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 285 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:38,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 915 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2022-10-16 02:28:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 2927. [2022-10-16 02:28:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2207 states have (on average 1.313094698685999) internal successors, (2898), 2226 states have internal predecessors, (2898), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2022-10-16 02:28:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3836 transitions. [2022-10-16 02:28:38,437 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3836 transitions. Word has length 118 [2022-10-16 02:28:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:38,437 INFO L495 AbstractCegarLoop]: Abstraction has 2927 states and 3836 transitions. [2022-10-16 02:28:38,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:28:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3836 transitions. [2022-10-16 02:28:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-10-16 02:28:38,444 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:38,445 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 02:28:38,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-10-16 02:28:38,445 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1982275884, now seen corresponding path program 1 times [2022-10-16 02:28:38,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:38,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489093634] [2022-10-16 02:28:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:38,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:28:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:28:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-16 02:28:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 02:28:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-10-16 02:28:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-10-16 02:28:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-16 02:28:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-10-16 02:28:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 02:28:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-10-16 02:28:39,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:39,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489093634] [2022-10-16 02:28:39,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489093634] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:28:39,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819211276] [2022-10-16 02:28:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:39,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:39,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:28:39,080 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 02:28:39,107 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 02:28:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:39,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 02:28:39,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:28:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 77 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-16 02:28:39,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:28:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-10-16 02:28:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819211276] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:28:39,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:28:39,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-10-16 02:28:39,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812694780] [2022-10-16 02:28:39,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:28:39,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 02:28:39,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:39,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 02:28:39,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-10-16 02:28:39,761 INFO L87 Difference]: Start difference. First operand 2927 states and 3836 transitions. Second operand has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-10-16 02:28:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:43,319 INFO L93 Difference]: Finished difference Result 7362 states and 10462 transitions. [2022-10-16 02:28:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-10-16 02:28:43,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 186 [2022-10-16 02:28:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:43,348 INFO L225 Difference]: With dead ends: 7362 [2022-10-16 02:28:43,348 INFO L226 Difference]: Without dead ends: 7362 [2022-10-16 02:28:43,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-10-16 02:28:43,351 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 4481 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:43,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 3286 Invalid, 3346 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1308 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-10-16 02:28:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2022-10-16 02:28:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 3451. [2022-10-16 02:28:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 2624 states have (on average 1.3090701219512195) internal successors, (3435), 2644 states have internal predecessors, (3435), 531 states have call successors, (531), 295 states have call predecessors, (531), 295 states have return successors, (531), 511 states have call predecessors, (531), 531 states have call successors, (531) [2022-10-16 02:28:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 4497 transitions. [2022-10-16 02:28:43,595 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 4497 transitions. Word has length 186 [2022-10-16 02:28:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:43,596 INFO L495 AbstractCegarLoop]: Abstraction has 3451 states and 4497 transitions. [2022-10-16 02:28:43,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-10-16 02:28:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 4497 transitions. [2022-10-16 02:28:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-10-16 02:28:43,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:43,606 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-10-16 02:28:43,660 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 02:28:43,821 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,SelfDestructingSolverStorable28 [2022-10-16 02:28:43,821 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1485219371, now seen corresponding path program 1 times [2022-10-16 02:28:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:43,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015389782] [2022-10-16 02:28:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:28:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:28:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:28:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:28:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:28:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:28:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 02:28:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-10-16 02:28:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-10-16 02:28:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-16 02:28:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-10-16 02:28:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 02:28:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-10-16 02:28:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-10-16 02:28:44,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:44,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015389782] [2022-10-16 02:28:44,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015389782] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:28:44,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380590827] [2022-10-16 02:28:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:44,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:44,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:28:44,488 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 02:28:44,511 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 02:28:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:44,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 02:28:44,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:28:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 02:28:45,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:28:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-10-16 02:28:45,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380590827] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:28:45,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:28:45,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-10-16 02:28:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367963165] [2022-10-16 02:28:45,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:28:45,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 02:28:45,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:45,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 02:28:45,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-10-16 02:28:45,290 INFO L87 Difference]: Start difference. First operand 3451 states and 4497 transitions. Second operand has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-10-16 02:28:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:55,400 INFO L93 Difference]: Finished difference Result 14377 states and 19715 transitions. [2022-10-16 02:28:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-16 02:28:55,401 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 194 [2022-10-16 02:28:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:55,450 INFO L225 Difference]: With dead ends: 14377 [2022-10-16 02:28:55,450 INFO L226 Difference]: Without dead ends: 14377 [2022-10-16 02:28:55,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-10-16 02:28:55,457 INFO L413 NwaCegarLoop]: 1832 mSDtfsCounter, 7211 mSDsluCounter, 15428 mSDsCounter, 0 mSdLazyCounter, 6197 mSolverCounterSat, 4423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7211 SdHoareTripleChecker+Valid, 17260 SdHoareTripleChecker+Invalid, 10620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4423 IncrementalHoareTripleChecker+Valid, 6197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:55,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7211 Valid, 17260 Invalid, 10620 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4423 Valid, 6197 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-10-16 02:28:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14377 states. [2022-10-16 02:28:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14377 to 6318. [2022-10-16 02:28:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6318 states, 4774 states have (on average 1.3112693757855047) internal successors, (6260), 4812 states have internal predecessors, (6260), 992 states have call successors, (992), 551 states have call predecessors, (992), 551 states have return successors, (992), 954 states have call predecessors, (992), 992 states have call successors, (992) [2022-10-16 02:28:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6318 states to 6318 states and 8244 transitions. [2022-10-16 02:28:55,741 INFO L78 Accepts]: Start accepts. Automaton has 6318 states and 8244 transitions. Word has length 194 [2022-10-16 02:28:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:55,744 INFO L495 AbstractCegarLoop]: Abstraction has 6318 states and 8244 transitions. [2022-10-16 02:28:55,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-10-16 02:28:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6318 states and 8244 transitions. [2022-10-16 02:28:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-10-16 02:28:55,760 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:55,761 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:55,801 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 02:28:55,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:55,975 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2054953212, now seen corresponding path program 1 times [2022-10-16 02:28:55,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:55,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879060168] [2022-10-16 02:28:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:28:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:28:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:28:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:28:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:28:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:28:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-16 02:28:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 02:28:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-10-16 02:28:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 02:28:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-10-16 02:28:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 02:28:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-10-16 02:28:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-10-16 02:28:56,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:56,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879060168] [2022-10-16 02:28:56,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879060168] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:56,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:56,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:28:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887479174] [2022-10-16 02:28:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:56,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:28:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:56,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:28:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:28:56,399 INFO L87 Difference]: Start difference. First operand 6318 states and 8244 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-16 02:28:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:56,744 INFO L93 Difference]: Finished difference Result 15378 states and 20725 transitions. [2022-10-16 02:28:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 02:28:56,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 196 [2022-10-16 02:28:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:56,802 INFO L225 Difference]: With dead ends: 15378 [2022-10-16 02:28:56,802 INFO L226 Difference]: Without dead ends: 15378 [2022-10-16 02:28:56,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-10-16 02:28:56,803 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 817 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:56,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 3094 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:28:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15378 states. [2022-10-16 02:28:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15378 to 8160. [2022-10-16 02:28:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8160 states, 6104 states have (on average 1.3086500655307995) internal successors, (7988), 6155 states have internal predecessors, (7988), 1335 states have call successors, (1335), 720 states have call predecessors, (1335), 720 states have return successors, (1335), 1284 states have call predecessors, (1335), 1335 states have call successors, (1335) [2022-10-16 02:28:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8160 states to 8160 states and 10658 transitions. [2022-10-16 02:28:57,170 INFO L78 Accepts]: Start accepts. Automaton has 8160 states and 10658 transitions. Word has length 196 [2022-10-16 02:28:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:57,171 INFO L495 AbstractCegarLoop]: Abstraction has 8160 states and 10658 transitions. [2022-10-16 02:28:57,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-16 02:28:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 8160 states and 10658 transitions. [2022-10-16 02:28:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-10-16 02:28:57,190 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:57,192 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:57,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-10-16 02:28:57,193 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash 765300617, now seen corresponding path program 1 times [2022-10-16 02:28:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:57,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136891111] [2022-10-16 02:28:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:28:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:28:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:28:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:28:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:28:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:28:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-16 02:28:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 02:28:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-10-16 02:28:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-10-16 02:28:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 02:28:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-10-16 02:28:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-10-16 02:28:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 02:28:57,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:57,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136891111] [2022-10-16 02:28:57,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136891111] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:28:57,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446825923] [2022-10-16 02:28:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:57,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:57,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:28:57,817 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 02:28:57,825 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 02:28:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:57,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 02:28:58,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:28:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 02:28:58,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:28:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-10-16 02:28:58,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446825923] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-16 02:28:58,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-16 02:28:58,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-10-16 02:28:58,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230754552] [2022-10-16 02:28:58,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:58,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 02:28:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:58,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 02:28:58,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-10-16 02:28:58,166 INFO L87 Difference]: Start difference. First operand 8160 states and 10658 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-16 02:28:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:58,215 INFO L93 Difference]: Finished difference Result 5594 states and 7293 transitions. [2022-10-16 02:28:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:28:58,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 198 [2022-10-16 02:28:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:58,240 INFO L225 Difference]: With dead ends: 5594 [2022-10-16 02:28:58,240 INFO L226 Difference]: Without dead ends: 5488 [2022-10-16 02:28:58,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-10-16 02:28:58,243 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1159 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 02:28:58,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1159 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:28:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2022-10-16 02:28:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2022-10-16 02:28:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5488 states, 4106 states have (on average 1.3080857282026304) internal successors, (5371), 4140 states have internal predecessors, (5371), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2022-10-16 02:28:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 7173 transitions. [2022-10-16 02:28:58,414 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 7173 transitions. Word has length 198 [2022-10-16 02:28:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:58,415 INFO L495 AbstractCegarLoop]: Abstraction has 5488 states and 7173 transitions. [2022-10-16 02:28:58,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-16 02:28:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 7173 transitions. [2022-10-16 02:28:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-10-16 02:28:58,428 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:58,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 02:28:58,469 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 02:28:58,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:58,641 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash -512077312, now seen corresponding path program 1 times [2022-10-16 02:28:58,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:58,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546843096] [2022-10-16 02:28:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:28:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:28:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:28:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:28:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:28:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:28:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-16 02:28:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-10-16 02:28:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-10-16 02:28:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-10-16 02:28:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 02:28:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-10-16 02:28:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-10-16 02:28:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 02:28:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:59,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546843096] [2022-10-16 02:28:59,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546843096] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:28:59,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241553440] [2022-10-16 02:28:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:59,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:59,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:28:59,505 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 02:28:59,527 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 02:28:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:59,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 02:28:59,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:29:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 71 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 02:29:00,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:29:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 02:29:00,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241553440] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:29:00,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:29:00,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2022-10-16 02:29:00,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516621728] [2022-10-16 02:29:00,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:29:00,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-16 02:29:00,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:00,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-16 02:29:00,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-10-16 02:29:00,534 INFO L87 Difference]: Start difference. First operand 5488 states and 7173 transitions. Second operand has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-10-16 02:29:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:18,696 INFO L93 Difference]: Finished difference Result 22107 states and 31345 transitions. [2022-10-16 02:29:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2022-10-16 02:29:18,697 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 198 [2022-10-16 02:29:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:18,780 INFO L225 Difference]: With dead ends: 22107 [2022-10-16 02:29:18,780 INFO L226 Difference]: Without dead ends: 22107 [2022-10-16 02:29:18,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20333 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5256, Invalid=44696, Unknown=0, NotChecked=0, Total=49952 [2022-10-16 02:29:18,795 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 9432 mSDsluCounter, 8286 mSDsCounter, 0 mSdLazyCounter, 12546 mSolverCounterSat, 4536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9432 SdHoareTripleChecker+Valid, 8988 SdHoareTripleChecker+Invalid, 17082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4536 IncrementalHoareTripleChecker+Valid, 12546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:18,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9432 Valid, 8988 Invalid, 17082 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4536 Valid, 12546 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-10-16 02:29:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22107 states. [2022-10-16 02:29:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22107 to 11273. [2022-10-16 02:29:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 8504 states have (on average 1.3065616180620885) internal successors, (11111), 8570 states have internal predecessors, (11111), 1785 states have call successors, (1785), 983 states have call predecessors, (1785), 983 states have return successors, (1785), 1719 states have call predecessors, (1785), 1785 states have call successors, (1785) [2022-10-16 02:29:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 14681 transitions. [2022-10-16 02:29:19,526 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 14681 transitions. Word has length 198 [2022-10-16 02:29:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:19,526 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 14681 transitions. [2022-10-16 02:29:19,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-10-16 02:29:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 14681 transitions. [2022-10-16 02:29:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-10-16 02:29:19,551 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:19,551 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-10-16 02:29:19,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 02:29:19,766 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,SelfDestructingSolverStorable32 [2022-10-16 02:29:19,767 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1533240021, now seen corresponding path program 1 times [2022-10-16 02:29:19,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:19,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666996357] [2022-10-16 02:29:19,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:19,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:29:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:29:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-16 02:29:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-10-16 02:29:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-10-16 02:29:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-10-16 02:29:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 02:29:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-10-16 02:29:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-10-16 02:29:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-10-16 02:29:20,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:20,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666996357] [2022-10-16 02:29:20,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666996357] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:29:20,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:29:20,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 02:29:20,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382296098] [2022-10-16 02:29:20,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:29:20,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 02:29:20,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:20,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 02:29:20,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:29:20,066 INFO L87 Difference]: Start difference. First operand 11273 states and 14681 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-16 02:29:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:20,255 INFO L93 Difference]: Finished difference Result 10523 states and 13723 transitions. [2022-10-16 02:29:20,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:29:20,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 198 [2022-10-16 02:29:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:20,290 INFO L225 Difference]: With dead ends: 10523 [2022-10-16 02:29:20,290 INFO L226 Difference]: Without dead ends: 10523 [2022-10-16 02:29:20,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:29:20,293 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 453 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:20,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 442 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:29:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2022-10-16 02:29:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10523. [2022-10-16 02:29:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 7946 states have (on average 1.30845708532595) internal successors, (10397), 8008 states have internal predecessors, (10397), 1663 states have call successors, (1663), 913 states have call predecessors, (1663), 913 states have return successors, (1663), 1601 states have call predecessors, (1663), 1663 states have call successors, (1663) [2022-10-16 02:29:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 13723 transitions. [2022-10-16 02:29:20,558 INFO L78 Accepts]: Start accepts. Automaton has 10523 states and 13723 transitions. Word has length 198 [2022-10-16 02:29:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:20,559 INFO L495 AbstractCegarLoop]: Abstraction has 10523 states and 13723 transitions. [2022-10-16 02:29:20,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-16 02:29:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10523 states and 13723 transitions. [2022-10-16 02:29:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-10-16 02:29:20,581 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:20,581 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-10-16 02:29:20,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-10-16 02:29:20,581 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:20,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1132054703, now seen corresponding path program 1 times [2022-10-16 02:29:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:20,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448485477] [2022-10-16 02:29:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:20,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:29:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:29:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-10-16 02:29:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-10-16 02:29:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-16 02:29:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-10-16 02:29:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-10-16 02:29:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-10-16 02:29:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-10-16 02:29:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 02:29:21,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:21,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448485477] [2022-10-16 02:29:21,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448485477] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:29:21,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710093866] [2022-10-16 02:29:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:21,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:21,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:29:21,416 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 02:29:21,437 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 02:29:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:21,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 02:29:21,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:29:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-16 02:29:21,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:29:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 02:29:21,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710093866] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:29:21,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:29:21,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-10-16 02:29:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958354144] [2022-10-16 02:29:21,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:29:21,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 02:29:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 02:29:21,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-10-16 02:29:21,875 INFO L87 Difference]: Start difference. First operand 10523 states and 13723 transitions. Second operand has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-10-16 02:29:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:27,674 INFO L93 Difference]: Finished difference Result 22305 states and 31536 transitions. [2022-10-16 02:29:27,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-16 02:29:27,674 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 199 [2022-10-16 02:29:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:27,741 INFO L225 Difference]: With dead ends: 22305 [2022-10-16 02:29:27,742 INFO L226 Difference]: Without dead ends: 22305 [2022-10-16 02:29:27,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2022-10-16 02:29:27,744 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 3062 mSDsluCounter, 6367 mSDsCounter, 0 mSdLazyCounter, 5350 mSolverCounterSat, 1477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3062 SdHoareTripleChecker+Valid, 7011 SdHoareTripleChecker+Invalid, 6827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1477 IncrementalHoareTripleChecker+Valid, 5350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:27,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3062 Valid, 7011 Invalid, 6827 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1477 Valid, 5350 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-10-16 02:29:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22305 states. [2022-10-16 02:29:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22305 to 11869. [2022-10-16 02:29:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11869 states, 8972 states have (on average 1.3039456085599643) internal successors, (11699), 9042 states have internal predecessors, (11699), 1863 states have call successors, (1863), 1033 states have call predecessors, (1863), 1033 states have return successors, (1863), 1793 states have call predecessors, (1863), 1863 states have call successors, (1863) [2022-10-16 02:29:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 15425 transitions. [2022-10-16 02:29:28,375 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 15425 transitions. Word has length 199 [2022-10-16 02:29:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:28,376 INFO L495 AbstractCegarLoop]: Abstraction has 11869 states and 15425 transitions. [2022-10-16 02:29:28,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-10-16 02:29:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 15425 transitions. [2022-10-16 02:29:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-10-16 02:29:28,410 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:28,410 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:29:28,455 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 02:29:28,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:28,626 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1502811457, now seen corresponding path program 1 times [2022-10-16 02:29:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:28,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146121491] [2022-10-16 02:29:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:29:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:29:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 02:29:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-10-16 02:29:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-16 02:29:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-10-16 02:29:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-10-16 02:29:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-10-16 02:29:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-10-16 02:29:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-10-16 02:29:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-10-16 02:29:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:28,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146121491] [2022-10-16 02:29:28,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146121491] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:29:28,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:29:28,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:29:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579370075] [2022-10-16 02:29:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:29:28,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:29:28,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:29:28,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:29:28,814 INFO L87 Difference]: Start difference. First operand 11869 states and 15425 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 02:29:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:28,973 INFO L93 Difference]: Finished difference Result 10725 states and 13938 transitions. [2022-10-16 02:29:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:29:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 207 [2022-10-16 02:29:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:29,006 INFO L225 Difference]: With dead ends: 10725 [2022-10-16 02:29:29,006 INFO L226 Difference]: Without dead ends: 10725 [2022-10-16 02:29:29,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:29:29,007 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 233 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:29,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 492 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:29:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10725 states. [2022-10-16 02:29:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10725 to 10693. [2022-10-16 02:29:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10693 states, 8112 states have (on average 1.3037475345167653) internal successors, (10576), 8174 states have internal predecessors, (10576), 1665 states have call successors, (1665), 915 states have call predecessors, (1665), 915 states have return successors, (1665), 1603 states have call predecessors, (1665), 1665 states have call successors, (1665) [2022-10-16 02:29:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 13906 transitions. [2022-10-16 02:29:29,289 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 13906 transitions. Word has length 207 [2022-10-16 02:29:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:29,290 INFO L495 AbstractCegarLoop]: Abstraction has 10693 states and 13906 transitions. [2022-10-16 02:29:29,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 02:29:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 13906 transitions. [2022-10-16 02:29:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-10-16 02:29:29,315 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:29,316 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:29:29,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-10-16 02:29:29,316 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1261331415, now seen corresponding path program 1 times [2022-10-16 02:29:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:29,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041239640] [2022-10-16 02:29:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:29:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:29:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:29:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:29:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:29:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:29:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 02:29:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-10-16 02:29:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-10-16 02:29:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-10-16 02:29:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-10-16 02:29:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 02:29:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-10-16 02:29:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-10-16 02:29:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-10-16 02:29:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:29,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041239640] [2022-10-16 02:29:29,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041239640] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:29:29,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572369013] [2022-10-16 02:29:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:29,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:29,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:29:29,665 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 02:29:29,674 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 02:29:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:29,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 02:29:29,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:29:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 8 proven. 115 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-10-16 02:29:30,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:29:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-10-16 02:29:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572369013] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:29:30,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:29:30,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-10-16 02:29:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638274011] [2022-10-16 02:29:30,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:29:30,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 02:29:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:30,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 02:29:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-10-16 02:29:30,509 INFO L87 Difference]: Start difference. First operand 10693 states and 13906 transitions. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-10-16 02:29:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:31,062 INFO L93 Difference]: Finished difference Result 23272 states and 30287 transitions. [2022-10-16 02:29:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 02:29:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 208 [2022-10-16 02:29:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:31,140 INFO L225 Difference]: With dead ends: 23272 [2022-10-16 02:29:31,141 INFO L226 Difference]: Without dead ends: 23272 [2022-10-16 02:29:31,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 443 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-10-16 02:29:31,142 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 784 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 3314 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:31,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 3314 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 02:29:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23272 states. [2022-10-16 02:29:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23272 to 16703. [2022-10-16 02:29:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16703 states, 12786 states have (on average 1.288596902862506) internal successors, (16476), 12901 states have internal predecessors, (16476), 2494 states have call successors, (2494), 1422 states have call predecessors, (2494), 1422 states have return successors, (2494), 2379 states have call predecessors, (2494), 2494 states have call successors, (2494) [2022-10-16 02:29:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 21464 transitions. [2022-10-16 02:29:31,647 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 21464 transitions. Word has length 208 [2022-10-16 02:29:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:31,648 INFO L495 AbstractCegarLoop]: Abstraction has 16703 states and 21464 transitions. [2022-10-16 02:29:31,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-10-16 02:29:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 21464 transitions. [2022-10-16 02:29:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-10-16 02:29:31,663 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:31,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:31,709 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 02:29:31,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:31,877 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:31,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1944127166, now seen corresponding path program 1 times [2022-10-16 02:29:31,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:31,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618155982] [2022-10-16 02:29:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:31,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:29:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:29:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 02:29:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-10-16 02:29:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-10-16 02:29:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-10-16 02:29:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-10-16 02:29:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-10-16 02:29:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-10-16 02:29:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-10-16 02:29:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-10-16 02:29:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:32,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618155982] [2022-10-16 02:29:32,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618155982] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:29:32,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037997066] [2022-10-16 02:29:32,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:32,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:32,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:29:32,395 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 02:29:32,414 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 02:29:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:32,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 02:29:32,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:29:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-16 02:29:32,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:29:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-10-16 02:29:33,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037997066] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:29:33,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:29:33,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-10-16 02:29:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070627051] [2022-10-16 02:29:33,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:29:33,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 02:29:33,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 02:29:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-10-16 02:29:33,043 INFO L87 Difference]: Start difference. First operand 16703 states and 21464 transitions. Second operand has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-10-16 02:29:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:33,294 INFO L93 Difference]: Finished difference Result 22530 states and 30564 transitions. [2022-10-16 02:29:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 02:29:33,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 208 [2022-10-16 02:29:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:33,369 INFO L225 Difference]: With dead ends: 22530 [2022-10-16 02:29:33,370 INFO L226 Difference]: Without dead ends: 22530 [2022-10-16 02:29:33,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 445 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 02:29:33,371 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 284 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:33,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 2291 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:29:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2022-10-16 02:29:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 16703. [2022-10-16 02:29:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16703 states, 12786 states have (on average 1.2882058501486) internal successors, (16471), 12901 states have internal predecessors, (16471), 2494 states have call successors, (2494), 1422 states have call predecessors, (2494), 1422 states have return successors, (2494), 2379 states have call predecessors, (2494), 2494 states have call successors, (2494) [2022-10-16 02:29:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 21459 transitions. [2022-10-16 02:29:33,982 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 21459 transitions. Word has length 208 [2022-10-16 02:29:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:33,983 INFO L495 AbstractCegarLoop]: Abstraction has 16703 states and 21459 transitions. [2022-10-16 02:29:33,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-10-16 02:29:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 21459 transitions. [2022-10-16 02:29:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-10-16 02:29:33,998 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:33,998 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:34,046 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 02:29:34,212 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,SelfDestructingSolverStorable37 [2022-10-16 02:29:34,213 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:34,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash 930512374, now seen corresponding path program 1 times [2022-10-16 02:29:34,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:34,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047630337] [2022-10-16 02:29:34,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:34,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:29:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:29:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 02:29:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 02:29:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-16 02:29:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 02:29:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 02:29:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-10-16 02:29:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-10-16 02:29:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-10-16 02:29:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-10-16 02:29:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-10-16 02:29:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:35,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047630337] [2022-10-16 02:29:35,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047630337] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:29:35,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600272810] [2022-10-16 02:29:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:35,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:35,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:29:35,279 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 02:29:35,297 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 02:29:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:35,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-16 02:29:35,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:29:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-16 02:29:36,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:29:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-10-16 02:29:37,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600272810] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:29:37,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:29:37,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 10] total 22 [2022-10-16 02:29:37,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348991107] [2022-10-16 02:29:37,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:29:37,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 02:29:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 02:29:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-10-16 02:29:37,763 INFO L87 Difference]: Start difference. First operand 16703 states and 21459 transitions. Second operand has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2022-10-16 02:29:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:42,486 INFO L93 Difference]: Finished difference Result 26697 states and 36072 transitions. [2022-10-16 02:29:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-16 02:29:42,487 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 215 [2022-10-16 02:29:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:42,559 INFO L225 Difference]: With dead ends: 26697 [2022-10-16 02:29:42,559 INFO L226 Difference]: Without dead ends: 26697 [2022-10-16 02:29:42,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 452 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=643, Invalid=1907, Unknown=0, NotChecked=0, Total=2550 [2022-10-16 02:29:42,561 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 4894 mSDsluCounter, 2683 mSDsCounter, 0 mSdLazyCounter, 2751 mSolverCounterSat, 1768 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4895 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 4519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1768 IncrementalHoareTripleChecker+Valid, 2751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:42,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4895 Valid, 3135 Invalid, 4519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1768 Valid, 2751 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-10-16 02:29:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26697 states. [2022-10-16 02:29:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26697 to 14070. [2022-10-16 02:29:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14070 states, 10675 states have (on average 1.2816861826697892) internal successors, (13682), 10776 states have internal predecessors, (13682), 2181 states have call successors, (2181), 1213 states have call predecessors, (2181), 1213 states have return successors, (2181), 2080 states have call predecessors, (2181), 2181 states have call successors, (2181) [2022-10-16 02:29:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14070 states to 14070 states and 18044 transitions. [2022-10-16 02:29:43,153 INFO L78 Accepts]: Start accepts. Automaton has 14070 states and 18044 transitions. Word has length 215 [2022-10-16 02:29:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:43,154 INFO L495 AbstractCegarLoop]: Abstraction has 14070 states and 18044 transitions. [2022-10-16 02:29:43,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2022-10-16 02:29:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14070 states and 18044 transitions. [2022-10-16 02:29:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-10-16 02:29:43,170 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:43,170 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:29:43,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 02:29:43,385 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,SelfDestructingSolverStorable38 [2022-10-16 02:29:43,386 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:43,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1140064983, now seen corresponding path program 1 times [2022-10-16 02:29:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:43,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599202274] [2022-10-16 02:29:43,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:43,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:29:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:29:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 02:29:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 02:29:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-16 02:29:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 02:29:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 02:29:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-10-16 02:29:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-10-16 02:29:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-10-16 02:29:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:43,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-10-16 02:29:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-10-16 02:29:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:44,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599202274] [2022-10-16 02:29:44,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599202274] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:29:44,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656885069] [2022-10-16 02:29:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:44,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:44,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:29:44,006 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 02:29:44,013 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 02:29:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:44,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 02:29:44,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:29:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 80 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-16 02:29:44,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:29:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-10-16 02:29:44,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656885069] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:29:44,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:29:44,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 14 [2022-10-16 02:29:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403151720] [2022-10-16 02:29:44,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:29:44,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 02:29:44,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 02:29:44,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-10-16 02:29:44,728 INFO L87 Difference]: Start difference. First operand 14070 states and 18044 transitions. Second operand has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-10-16 02:29:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:47,854 INFO L93 Difference]: Finished difference Result 31438 states and 43142 transitions. [2022-10-16 02:29:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-10-16 02:29:47,855 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) Word has length 216 [2022-10-16 02:29:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:47,929 INFO L225 Difference]: With dead ends: 31438 [2022-10-16 02:29:47,929 INFO L226 Difference]: Without dead ends: 31438 [2022-10-16 02:29:47,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2124 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=952, Invalid=5054, Unknown=0, NotChecked=0, Total=6006 [2022-10-16 02:29:47,931 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 1980 mSDsluCounter, 8428 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 9410 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:47,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 9410 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-10-16 02:29:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31438 states. [2022-10-16 02:29:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31438 to 17971. [2022-10-16 02:29:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17971 states, 13831 states have (on average 1.2728653025811583) internal successors, (17605), 13950 states have internal predecessors, (17605), 2623 states have call successors, (2623), 1516 states have call predecessors, (2623), 1516 states have return successors, (2623), 2504 states have call predecessors, (2623), 2623 states have call successors, (2623) [2022-10-16 02:29:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17971 states to 17971 states and 22851 transitions. [2022-10-16 02:29:48,620 INFO L78 Accepts]: Start accepts. Automaton has 17971 states and 22851 transitions. Word has length 216 [2022-10-16 02:29:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:48,621 INFO L495 AbstractCegarLoop]: Abstraction has 17971 states and 22851 transitions. [2022-10-16 02:29:48,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-10-16 02:29:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17971 states and 22851 transitions. [2022-10-16 02:29:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-10-16 02:29:48,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:48,635 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:29:48,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 02:29:48,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-10-16 02:29:48,850 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash -228395627, now seen corresponding path program 1 times [2022-10-16 02:29:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:48,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548583652] [2022-10-16 02:29:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:29:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:29:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 02:29:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 02:29:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-16 02:29:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 02:29:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 02:29:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-10-16 02:29:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-10-16 02:29:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-10-16 02:29:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-10-16 02:29:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-10-16 02:29:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:49,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548583652] [2022-10-16 02:29:49,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548583652] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:29:49,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:29:49,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:29:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624951804] [2022-10-16 02:29:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:29:49,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:29:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:29:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:29:49,017 INFO L87 Difference]: Start difference. First operand 17971 states and 22851 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-16 02:29:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:49,189 INFO L93 Difference]: Finished difference Result 13650 states and 17361 transitions. [2022-10-16 02:29:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:29:49,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 216 [2022-10-16 02:29:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:49,215 INFO L225 Difference]: With dead ends: 13650 [2022-10-16 02:29:49,215 INFO L226 Difference]: Without dead ends: 13650 [2022-10-16 02:29:49,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:29:49,216 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 239 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:49,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 488 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:29:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13650 states. [2022-10-16 02:29:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13650 to 13607. [2022-10-16 02:29:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13607 states, 10554 states have (on average 1.2748720864127345) internal successors, (13455), 10636 states have internal predecessors, (13455), 1931 states have call successors, (1931), 1121 states have call predecessors, (1931), 1121 states have return successors, (1931), 1849 states have call predecessors, (1931), 1931 states have call successors, (1931) [2022-10-16 02:29:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13607 states to 13607 states and 17317 transitions. [2022-10-16 02:29:49,641 INFO L78 Accepts]: Start accepts. Automaton has 13607 states and 17317 transitions. Word has length 216 [2022-10-16 02:29:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:49,641 INFO L495 AbstractCegarLoop]: Abstraction has 13607 states and 17317 transitions. [2022-10-16 02:29:49,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-16 02:29:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 13607 states and 17317 transitions. [2022-10-16 02:29:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-10-16 02:29:49,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:49,658 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:29:49,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-10-16 02:29:49,658 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:49,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1629013462, now seen corresponding path program 1 times [2022-10-16 02:29:49,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:49,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040420788] [2022-10-16 02:29:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:49,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:29:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:29:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:29:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:29:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:29:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:29:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 02:29:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-16 02:29:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-10-16 02:29:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-10-16 02:29:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-10-16 02:29:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-16 02:29:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-10-16 02:29:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-10-16 02:29:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-10-16 02:29:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-10-16 02:29:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-10-16 02:29:49,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:49,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040420788] [2022-10-16 02:29:49,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040420788] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:29:49,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:29:49,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:29:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917634660] [2022-10-16 02:29:49,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:29:49,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:29:49,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:29:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:29:49,993 INFO L87 Difference]: Start difference. First operand 13607 states and 17317 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-10-16 02:29:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:50,336 INFO L93 Difference]: Finished difference Result 25650 states and 33410 transitions. [2022-10-16 02:29:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 02:29:50,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 217 [2022-10-16 02:29:50,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:50,398 INFO L225 Difference]: With dead ends: 25650 [2022-10-16 02:29:50,398 INFO L226 Difference]: Without dead ends: 25650 [2022-10-16 02:29:50,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-10-16 02:29:50,399 INFO L413 NwaCegarLoop]: 586 mSDtfsCounter, 615 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:50,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 3014 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:29:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25650 states. [2022-10-16 02:29:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25650 to 16802. [2022-10-16 02:29:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2675574891236794) internal successors, (16316), 12986 states have internal predecessors, (16316), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-10-16 02:29:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21292 transitions. [2022-10-16 02:29:50,851 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21292 transitions. Word has length 217 [2022-10-16 02:29:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:50,852 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21292 transitions. [2022-10-16 02:29:50,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-10-16 02:29:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21292 transitions. [2022-10-16 02:29:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-10-16 02:29:50,863 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:50,863 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 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, 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] [2022-10-16 02:29:50,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-10-16 02:29:50,864 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1523429711, now seen corresponding path program 1 times [2022-10-16 02:29:50,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:50,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181164666] [2022-10-16 02:29:50,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 02:29:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 02:29:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 02:29:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 02:29:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:29:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:29:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 02:29:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-10-16 02:29:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-10-16 02:29:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-10-16 02:29:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-10-16 02:29:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 02:29:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-10-16 02:29:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-10-16 02:29:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-10-16 02:29:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-10-16 02:29:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 41 proven. 10 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-10-16 02:29:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:51,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181164666] [2022-10-16 02:29:51,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181164666] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:29:51,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882102475] [2022-10-16 02:29:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:51,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:51,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:29:51,709 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 02:29:51,720 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 02:29:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:51,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 02:29:51,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:29:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-10-16 02:29:52,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 02:29:52,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882102475] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:29:52,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 02:29:52,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-10-16 02:29:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469298399] [2022-10-16 02:29:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:29:52,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:29:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:29:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-10-16 02:29:52,071 INFO L87 Difference]: Start difference. First operand 16802 states and 21292 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-10-16 02:29:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:52,570 INFO L93 Difference]: Finished difference Result 20739 states and 27282 transitions. [2022-10-16 02:29:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 02:29:52,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 218 [2022-10-16 02:29:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:52,608 INFO L225 Difference]: With dead ends: 20739 [2022-10-16 02:29:52,608 INFO L226 Difference]: Without dead ends: 20739 [2022-10-16 02:29:52,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-10-16 02:29:52,609 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 674 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:52,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 2222 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 02:29:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20739 states. [2022-10-16 02:29:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20739 to 16802. [2022-10-16 02:29:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2608763206960845) internal successors, (16230), 12986 states have internal predecessors, (16230), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-10-16 02:29:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21206 transitions. [2022-10-16 02:29:52,998 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21206 transitions. Word has length 218 [2022-10-16 02:29:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:52,999 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21206 transitions. [2022-10-16 02:29:52,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-10-16 02:29:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21206 transitions. [2022-10-16 02:29:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-10-16 02:29:53,010 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:53,010 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 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, 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] [2022-10-16 02:29:53,048 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 02:29:53,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-10-16 02:29:53,226 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:53,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash -944726497, now seen corresponding path program 1 times [2022-10-16 02:29:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:53,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938217798] [2022-10-16 02:29:53,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:29:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:29:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 02:29:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 02:29:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-16 02:29:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 02:29:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 02:29:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-10-16 02:29:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-10-16 02:29:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-10-16 02:29:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-10-16 02:29:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-10-16 02:29:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-10-16 02:29:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938217798] [2022-10-16 02:29:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938217798] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:29:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233917664] [2022-10-16 02:29:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:54,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:29:54,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:29:54,109 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 02:29:54,128 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 02:29:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:54,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 02:29:54,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:29:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 66 proven. 60 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-16 02:29:54,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:29:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-10-16 02:29:55,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233917664] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:29:55,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:29:55,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-10-16 02:29:55,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968834866] [2022-10-16 02:29:55,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:29:55,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 02:29:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:55,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 02:29:55,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-10-16 02:29:55,050 INFO L87 Difference]: Start difference. First operand 16802 states and 21206 transitions. Second operand has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-10-16 02:29:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:56,217 INFO L93 Difference]: Finished difference Result 19596 states and 24803 transitions. [2022-10-16 02:29:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 02:29:56,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) Word has length 224 [2022-10-16 02:29:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:56,257 INFO L225 Difference]: With dead ends: 19596 [2022-10-16 02:29:56,257 INFO L226 Difference]: Without dead ends: 19596 [2022-10-16 02:29:56,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 481 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-10-16 02:29:56,258 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 1621 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 3928 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:56,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 3928 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 02:29:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19596 states. [2022-10-16 02:29:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19596 to 16802. [2022-10-16 02:29:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2569142324425109) internal successors, (16179), 12986 states have internal predecessors, (16179), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-10-16 02:29:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21155 transitions. [2022-10-16 02:29:56,563 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21155 transitions. Word has length 224 [2022-10-16 02:29:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:56,564 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21155 transitions. [2022-10-16 02:29:56,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-10-16 02:29:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21155 transitions. [2022-10-16 02:29:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-10-16 02:29:56,578 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:56,578 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:29:56,620 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 02:29:56,793 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,SelfDestructingSolverStorable43 [2022-10-16 02:29:56,794 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:56,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1098934206, now seen corresponding path program 1 times [2022-10-16 02:29:56,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:56,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649642508] [2022-10-16 02:29:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:29:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:29:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:29:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:29:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:29:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:29:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:29:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:29:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-10-16 02:29:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 02:29:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-10-16 02:29:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 02:29:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 02:29:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-10-16 02:29:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-10-16 02:29:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-10-16 02:29:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-10-16 02:29:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-10-16 02:29:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:29:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-10-16 02:29:57,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:29:57,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649642508] [2022-10-16 02:29:57,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649642508] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:29:57,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:29:57,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:29:57,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491000899] [2022-10-16 02:29:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:29:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:29:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:29:57,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:29:57,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:29:57,353 INFO L87 Difference]: Start difference. First operand 16802 states and 21155 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-10-16 02:29:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:29:57,968 INFO L93 Difference]: Finished difference Result 20749 states and 26868 transitions. [2022-10-16 02:29:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 02:29:57,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 224 [2022-10-16 02:29:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:29:58,008 INFO L225 Difference]: With dead ends: 20749 [2022-10-16 02:29:58,008 INFO L226 Difference]: Without dead ends: 20749 [2022-10-16 02:29:58,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-10-16 02:29:58,009 INFO L413 NwaCegarLoop]: 610 mSDtfsCounter, 711 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 02:29:58,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 2593 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 02:29:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2022-10-16 02:29:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 16793. [2022-10-16 02:29:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16793 states, 12863 states have (on average 1.2556946280027987) internal successors, (16152), 12977 states have internal predecessors, (16152), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-10-16 02:29:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 21128 transitions. [2022-10-16 02:29:58,325 INFO L78 Accepts]: Start accepts. Automaton has 16793 states and 21128 transitions. Word has length 224 [2022-10-16 02:29:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:29:58,326 INFO L495 AbstractCegarLoop]: Abstraction has 16793 states and 21128 transitions. [2022-10-16 02:29:58,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-10-16 02:29:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 16793 states and 21128 transitions. [2022-10-16 02:29:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-10-16 02:29:58,337 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:29:58,337 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:29:58,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-10-16 02:29:58,338 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:29:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:29:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash -246135084, now seen corresponding path program 1 times [2022-10-16 02:29:58,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:29:58,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814557073] [2022-10-16 02:29:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:29:58,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:29:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 02:29:58,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 02:29:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 02:29:58,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 02:29:58,652 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 02:29:58,653 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-16 02:29:58,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-16 02:29:58,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-10-16 02:29:58,664 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, 1, 1, 1, 1, 1] [2022-10-16 02:29:58,671 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 02:29:58,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:29:58 BoogieIcfgContainer [2022-10-16 02:29:58,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 02:29:58,942 INFO L158 Benchmark]: Toolchain (without parser) took 98266.59ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 124.0MB in the beginning and 692.5MB in the end (delta: -568.5MB). Peak memory consumption was 441.2MB. Max. memory is 8.0GB. [2022-10-16 02:29:58,942 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 02:29:58,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.97ms. Allocated memory is still 151.0MB. Free memory was 123.8MB in the beginning and 106.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-16 02:29:58,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.83ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 103.6MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 02:29:58,943 INFO L158 Benchmark]: Boogie Preprocessor took 103.98ms. Allocated memory is still 151.0MB. Free memory was 103.6MB in the beginning and 100.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 02:29:58,943 INFO L158 Benchmark]: RCFGBuilder took 1057.07ms. Allocated memory is still 151.0MB. Free memory was 100.8MB in the beginning and 100.2MB in the end (delta: 568.8kB). Peak memory consumption was 6.0MB. Max. memory is 8.0GB. [2022-10-16 02:29:58,943 INFO L158 Benchmark]: TraceAbstraction took 96459.88ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 99.2MB in the beginning and 692.5MB in the end (delta: -593.3MB). Peak memory consumption was 415.3MB. Max. memory is 8.0GB. [2022-10-16 02:29:58,944 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.32ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 502.97ms. Allocated memory is still 151.0MB. Free memory was 123.8MB in the beginning and 106.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 127.83ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 103.6MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.98ms. Allocated memory is still 151.0MB. Free memory was 103.6MB in the beginning and 100.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1057.07ms. Allocated memory is still 151.0MB. Free memory was 100.8MB in the beginning and 100.2MB in the end (delta: 568.8kB). Peak memory consumption was 6.0MB. Max. memory is 8.0GB. * TraceAbstraction took 96459.88ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 99.2MB in the beginning and 692.5MB in the end (delta: -593.3MB). Peak memory consumption was 415.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 619]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 619. Possible FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L606] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=2] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-128, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-128, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=2, tmp___7=1, tmp___8=0] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=2, tmp___7=1, tmp___8=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - UnprovableResult [Line: 540]: 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, 208 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 96.1s, OverallIterations: 46, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 56.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46351 SdHoareTripleChecker+Valid, 35.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45932 mSDsluCounter, 105256 SdHoareTripleChecker+Invalid, 30.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84459 mSDsCounter, 16085 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35939 IncrementalHoareTripleChecker+Invalid, 52024 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16085 mSolverCounterUnsat, 20797 mSDtfsCounter, 35939 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6290 GetRequests, 5424 SyntacticMatches, 17 SemanticMatches, 849 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31849 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17971occurred in iteration=40, InterpolantAutomatonStates: 796, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 45 MinimizatonAttempts, 109773 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 8694 NumberOfCodeBlocks, 8694 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 10448 ConstructedInterpolants, 0 QuantifiedInterpolants, 33961 SizeOfPredicates, 35 NumberOfNonLiveVariables, 9636 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 67 InterpolantComputations, 36 PerfectInterpolantSequences, 4160/4835 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 02:29:59,003 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...