./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:07:29,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:07:29,124 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 05:07:29,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:07:29,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:07:29,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:07:29,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:07:29,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:07:29,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:07:29,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:07:29,171 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:07:29,172 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:07:29,173 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:07:29,173 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:07:29,174 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:07:29,175 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:07:29,175 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:07:29,176 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:07:29,177 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:07:29,177 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:07:29,178 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:07:29,179 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:07:29,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:07:29,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:07:29,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:07:29,181 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:07:29,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:07:29,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:07:29,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:07:29,183 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:07:29,184 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:07:29,185 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:07:29,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:07:29,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:07:29,186 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:07:29,187 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:07:29,187 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:07:29,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:07:29,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:07:29,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:07:29,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:07:29,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:07:29,191 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:07:29,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:07:29,192 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:07:29,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:07:29,193 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2023-11-19 05:07:29,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:07:29,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:07:29,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:07:29,578 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:07:29,580 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:07:29,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:07:33,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:07:33,594 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:07:33,595 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:07:33,618 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/data/5e72f279d/ed4c61a925a042f9834f1413a3f2d8e1/FLAG35f975015 [2023-11-19 05:07:33,636 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/data/5e72f279d/ed4c61a925a042f9834f1413a3f2d8e1 [2023-11-19 05:07:33,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:07:33,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:07:33,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:07:33,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:07:33,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:07:33,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:07:33" (1/1) ... [2023-11-19 05:07:33,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d535e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:33, skipping insertion in model container [2023-11-19 05:07:33,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:07:33" (1/1) ... [2023-11-19 05:07:33,713 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:07:34,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:07:34,351 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:07:34,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:07:34,532 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:07:34,532 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:07:34,542 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:07:34,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34 WrapperNode [2023-11-19 05:07:34,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:07:34,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:07:34,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:07:34,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:07:34,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,667 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-11-19 05:07:34,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:07:34,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:07:34,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:07:34,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:07:34,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:07:34,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:07:34,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:07:34,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:07:34,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (1/1) ... [2023-11-19 05:07:34,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:07:34,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:07:34,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:07:34,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:07:34,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 05:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:07:34,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:07:34,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 05:07:34,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 05:07:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 05:07:34,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 05:07:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 05:07:34,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 05:07:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:07:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 05:07:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:07:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:07:34,868 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 05:07:35,086 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:07:35,089 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:07:35,670 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:07:35,927 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:07:35,927 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:07:35,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:07:35 BoogieIcfgContainer [2023-11-19 05:07:35,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:07:35,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:07:35,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:07:35,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:07:35,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:07:33" (1/3) ... [2023-11-19 05:07:35,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4015efe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:07:35, skipping insertion in model container [2023-11-19 05:07:35,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:07:34" (2/3) ... [2023-11-19 05:07:35,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4015efe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:07:35, skipping insertion in model container [2023-11-19 05:07:35,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:07:35" (3/3) ... [2023-11-19 05:07:35,944 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 05:07:35,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:07:35,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 05:07:35,968 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 05:07:36,054 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 05:07:36,113 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 05:07:36,141 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 125 transitions, 262 flow [2023-11-19 05:07:36,145 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 125 transitions, 262 flow [2023-11-19 05:07:36,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 125 transitions, 262 flow [2023-11-19 05:07:36,244 INFO L124 PetriNetUnfolderBase]: 4/122 cut-off events. [2023-11-19 05:07:36,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 05:07:36,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 4/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-19 05:07:36,259 INFO L119 LiptonReduction]: Number of co-enabled transitions 2686 [2023-11-19 05:07:42,907 INFO L134 LiptonReduction]: Checked pairs total: 6120 [2023-11-19 05:07:42,908 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-11-19 05:07:42,924 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 82 flow [2023-11-19 05:07:43,073 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:43,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:07:43,104 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;@ab8d0d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:07:43,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 05:07:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 05:07:43,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:43,116 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 05:07:43,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:43,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:43,123 INFO L85 PathProgramCache]: Analyzing trace with hash 565, now seen corresponding path program 1 times [2023-11-19 05:07:43,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:43,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733709655] [2023-11-19 05:07:43,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:43,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733709655] [2023-11-19 05:07:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733709655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:43,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 05:07:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613928823] [2023-11-19 05:07:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:43,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 05:07:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 05:07:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:07:43,348 INFO L87 Difference]: Start difference. First operand has 1098 states, 1083 states have (on average 3.332409972299169) internal successors, (3609), 1097 states have internal predecessors, (3609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:43,512 INFO L93 Difference]: Finished difference Result 1024 states and 3277 transitions. [2023-11-19 05:07:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 05:07:43,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2023-11-19 05:07:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:43,563 INFO L225 Difference]: With dead ends: 1024 [2023-11-19 05:07:43,563 INFO L226 Difference]: Without dead ends: 1024 [2023-11-19 05:07:43,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 05:07:43,574 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:43,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:07:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2023-11-19 05:07:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2023-11-19 05:07:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 3.215897939156035) internal successors, (3277), 1023 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 3277 transitions. [2023-11-19 05:07:43,737 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 3277 transitions. Word has length 1 [2023-11-19 05:07:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:43,738 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 3277 transitions. [2023-11-19 05:07:43,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 3277 transitions. [2023-11-19 05:07:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-19 05:07:43,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:43,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-19 05:07:43,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:07:43,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:43,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:43,742 INFO L85 PathProgramCache]: Analyzing trace with hash 557979, now seen corresponding path program 1 times [2023-11-19 05:07:43,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:43,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989526154] [2023-11-19 05:07:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:44,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989526154] [2023-11-19 05:07:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989526154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:44,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:07:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986560703] [2023-11-19 05:07:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:44,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:07:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:07:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:07:44,183 INFO L87 Difference]: Start difference. First operand 1024 states and 3277 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:44,293 INFO L93 Difference]: Finished difference Result 837 states and 2640 transitions. [2023-11-19 05:07:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:07:44,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-19 05:07:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:44,304 INFO L225 Difference]: With dead ends: 837 [2023-11-19 05:07:44,304 INFO L226 Difference]: Without dead ends: 812 [2023-11-19 05:07:44,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:07:44,307 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:44,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:07:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2023-11-19 05:07:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2023-11-19 05:07:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 810 states have (on average 3.1790123456790123) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2023-11-19 05:07:44,353 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2023-11-19 05:07:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:44,353 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2023-11-19 05:07:44,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2023-11-19 05:07:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:07:44,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:44,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:44,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:07:44,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:44,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash 297470514, now seen corresponding path program 1 times [2023-11-19 05:07:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429417017] [2023-11-19 05:07:44,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:45,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429417017] [2023-11-19 05:07:45,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429417017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:45,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:07:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541678442] [2023-11-19 05:07:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:45,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:07:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:45,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:07:45,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:07:45,313 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:45,476 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2023-11-19 05:07:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:07:45,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 05:07:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:45,485 INFO L225 Difference]: With dead ends: 687 [2023-11-19 05:07:45,485 INFO L226 Difference]: Without dead ends: 687 [2023-11-19 05:07:45,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:07:45,487 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:45,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:07:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-11-19 05:07:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2023-11-19 05:07:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2023-11-19 05:07:45,527 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 10 [2023-11-19 05:07:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:45,528 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2023-11-19 05:07:45,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2023-11-19 05:07:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:07:45,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:45,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:45,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:07:45,534 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:45,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash 297470485, now seen corresponding path program 1 times [2023-11-19 05:07:45,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947207362] [2023-11-19 05:07:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:46,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947207362] [2023-11-19 05:07:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947207362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:46,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:46,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:07:46,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495680163] [2023-11-19 05:07:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:46,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:07:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:07:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:07:46,863 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:47,280 INFO L93 Difference]: Finished difference Result 1046 states and 3194 transitions. [2023-11-19 05:07:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:07:47,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 05:07:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:47,292 INFO L225 Difference]: With dead ends: 1046 [2023-11-19 05:07:47,292 INFO L226 Difference]: Without dead ends: 880 [2023-11-19 05:07:47,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:07:47,294 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:47,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 20 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:07:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2023-11-19 05:07:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 710. [2023-11-19 05:07:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 3.080394922425952) internal successors, (2184), 709 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 2184 transitions. [2023-11-19 05:07:47,387 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 2184 transitions. Word has length 10 [2023-11-19 05:07:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:47,387 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 2184 transitions. [2023-11-19 05:07:47,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 2184 transitions. [2023-11-19 05:07:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:07:47,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:47,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:47,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:07:47,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:47,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash 631695994, now seen corresponding path program 1 times [2023-11-19 05:07:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:47,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033417255] [2023-11-19 05:07:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:47,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:47,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033417255] [2023-11-19 05:07:47,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033417255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:47,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:47,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:07:47,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117717332] [2023-11-19 05:07:47,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:47,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:07:47,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:07:47,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:07:47,696 INFO L87 Difference]: Start difference. First operand 710 states and 2184 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:47,846 INFO L93 Difference]: Finished difference Result 794 states and 2367 transitions. [2023-11-19 05:07:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:07:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 05:07:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:47,856 INFO L225 Difference]: With dead ends: 794 [2023-11-19 05:07:47,856 INFO L226 Difference]: Without dead ends: 694 [2023-11-19 05:07:47,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:07:47,858 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:47,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:07:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2023-11-19 05:07:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2023-11-19 05:07:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 3.064935064935065) internal successors, (2124), 693 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 2124 transitions. [2023-11-19 05:07:47,900 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 2124 transitions. Word has length 11 [2023-11-19 05:07:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:47,901 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 2124 transitions. [2023-11-19 05:07:47,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 2124 transitions. [2023-11-19 05:07:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:07:47,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:47,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:47,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:07:47,910 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:47,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash -648735687, now seen corresponding path program 1 times [2023-11-19 05:07:47,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:47,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29913735] [2023-11-19 05:07:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:48,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29913735] [2023-11-19 05:07:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29913735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:07:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131465759] [2023-11-19 05:07:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:48,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:07:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:07:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:07:48,190 INFO L87 Difference]: Start difference. First operand 694 states and 2124 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:48,359 INFO L93 Difference]: Finished difference Result 1111 states and 3272 transitions. [2023-11-19 05:07:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:07:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 05:07:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:48,368 INFO L225 Difference]: With dead ends: 1111 [2023-11-19 05:07:48,368 INFO L226 Difference]: Without dead ends: 768 [2023-11-19 05:07:48,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:07:48,373 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:48,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 17 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:07:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2023-11-19 05:07:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 641. [2023-11-19 05:07:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 2.9640625) internal successors, (1897), 640 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1897 transitions. [2023-11-19 05:07:48,414 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1897 transitions. Word has length 12 [2023-11-19 05:07:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:48,415 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 1897 transitions. [2023-11-19 05:07:48,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1897 transitions. [2023-11-19 05:07:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:07:48,417 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:48,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:48,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:07:48,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:48,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1640650863, now seen corresponding path program 1 times [2023-11-19 05:07:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:48,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905737605] [2023-11-19 05:07:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:49,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:49,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905737605] [2023-11-19 05:07:49,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905737605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:49,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:49,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:07:49,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006883133] [2023-11-19 05:07:49,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:49,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:07:49,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:49,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:07:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:07:49,015 INFO L87 Difference]: Start difference. First operand 641 states and 1897 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:49,182 INFO L93 Difference]: Finished difference Result 713 states and 2055 transitions. [2023-11-19 05:07:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:07:49,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 05:07:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:49,189 INFO L225 Difference]: With dead ends: 713 [2023-11-19 05:07:49,189 INFO L226 Difference]: Without dead ends: 633 [2023-11-19 05:07:49,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:07:49,191 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:49,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 17 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:07:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2023-11-19 05:07:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2023-11-19 05:07:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 2.954113924050633) internal successors, (1867), 632 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1867 transitions. [2023-11-19 05:07:49,221 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1867 transitions. Word has length 12 [2023-11-19 05:07:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:49,222 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 1867 transitions. [2023-11-19 05:07:49,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1867 transitions. [2023-11-19 05:07:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:07:49,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:49,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:49,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:07:49,224 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:49,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash -679443869, now seen corresponding path program 1 times [2023-11-19 05:07:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:49,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28344061] [2023-11-19 05:07:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:49,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:49,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28344061] [2023-11-19 05:07:49,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28344061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:49,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:49,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:07:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057600824] [2023-11-19 05:07:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:49,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:07:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:07:49,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:07:49,874 INFO L87 Difference]: Start difference. First operand 633 states and 1867 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:50,099 INFO L93 Difference]: Finished difference Result 702 states and 2031 transitions. [2023-11-19 05:07:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:07:50,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 05:07:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:50,106 INFO L225 Difference]: With dead ends: 702 [2023-11-19 05:07:50,107 INFO L226 Difference]: Without dead ends: 642 [2023-11-19 05:07:50,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:07:50,108 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:50,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 22 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:07:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2023-11-19 05:07:50,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 638. [2023-11-19 05:07:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 2.9513343799058083) internal successors, (1880), 637 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1880 transitions. [2023-11-19 05:07:50,140 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1880 transitions. Word has length 13 [2023-11-19 05:07:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:50,140 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1880 transitions. [2023-11-19 05:07:50,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1880 transitions. [2023-11-19 05:07:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:07:50,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:50,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:50,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:07:50,143 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:50,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash -679383326, now seen corresponding path program 1 times [2023-11-19 05:07:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:50,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078798682] [2023-11-19 05:07:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:50,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:50,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078798682] [2023-11-19 05:07:50,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078798682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:50,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:50,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:07:50,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417314733] [2023-11-19 05:07:50,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:50,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:07:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:50,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:07:50,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:07:50,831 INFO L87 Difference]: Start difference. First operand 638 states and 1880 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:51,045 INFO L93 Difference]: Finished difference Result 742 states and 2133 transitions. [2023-11-19 05:07:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:07:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 05:07:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:51,054 INFO L225 Difference]: With dead ends: 742 [2023-11-19 05:07:51,054 INFO L226 Difference]: Without dead ends: 662 [2023-11-19 05:07:51,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:07:51,056 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:51,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 17 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:07:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-11-19 05:07:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2023-11-19 05:07:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 2.9377845220030347) internal successors, (1936), 659 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1936 transitions. [2023-11-19 05:07:51,098 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1936 transitions. Word has length 13 [2023-11-19 05:07:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:51,099 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 1936 transitions. [2023-11-19 05:07:51,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1936 transitions. [2023-11-19 05:07:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:07:51,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:51,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:51,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:07:51,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:51,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash -642454979, now seen corresponding path program 2 times [2023-11-19 05:07:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:51,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961463281] [2023-11-19 05:07:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:51,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:51,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961463281] [2023-11-19 05:07:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961463281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:51,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:07:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609064256] [2023-11-19 05:07:51,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:51,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:07:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:51,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:07:51,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:07:51,764 INFO L87 Difference]: Start difference. First operand 660 states and 1936 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:52,074 INFO L93 Difference]: Finished difference Result 724 states and 2081 transitions. [2023-11-19 05:07:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:07:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 05:07:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:52,082 INFO L225 Difference]: With dead ends: 724 [2023-11-19 05:07:52,083 INFO L226 Difference]: Without dead ends: 662 [2023-11-19 05:07:52,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:07:52,084 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:52,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 19 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:07:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-11-19 05:07:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 657. [2023-11-19 05:07:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 2.9359756097560976) internal successors, (1926), 656 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1926 transitions. [2023-11-19 05:07:52,119 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1926 transitions. Word has length 13 [2023-11-19 05:07:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:52,120 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 1926 transitions. [2023-11-19 05:07:52,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1926 transitions. [2023-11-19 05:07:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:07:52,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:52,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:52,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:07:52,123 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:52,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 412064432, now seen corresponding path program 1 times [2023-11-19 05:07:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598698232] [2023-11-19 05:07:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:52,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598698232] [2023-11-19 05:07:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598698232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:52,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:07:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472594015] [2023-11-19 05:07:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:52,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:07:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:52,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:07:52,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:07:52,746 INFO L87 Difference]: Start difference. First operand 657 states and 1926 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:52,996 INFO L93 Difference]: Finished difference Result 720 states and 2074 transitions. [2023-11-19 05:07:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:07:52,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 05:07:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:53,004 INFO L225 Difference]: With dead ends: 720 [2023-11-19 05:07:53,004 INFO L226 Difference]: Without dead ends: 680 [2023-11-19 05:07:53,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:07:53,006 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:53,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 22 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:07:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-11-19 05:07:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 672. [2023-11-19 05:07:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.9210134128166914) internal successors, (1960), 671 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1960 transitions. [2023-11-19 05:07:53,041 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1960 transitions. Word has length 14 [2023-11-19 05:07:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:53,042 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1960 transitions. [2023-11-19 05:07:53,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1960 transitions. [2023-11-19 05:07:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:07:53,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:53,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:53,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:07:53,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:53,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:53,046 INFO L85 PathProgramCache]: Analyzing trace with hash 412124014, now seen corresponding path program 1 times [2023-11-19 05:07:53,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115185241] [2023-11-19 05:07:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:53,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:53,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:53,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115185241] [2023-11-19 05:07:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115185241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:53,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:53,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:07:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931927779] [2023-11-19 05:07:53,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:53,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:07:53,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:53,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:07:53,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:07:53,564 INFO L87 Difference]: Start difference. First operand 672 states and 1960 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:53,835 INFO L93 Difference]: Finished difference Result 836 states and 2428 transitions. [2023-11-19 05:07:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:07:53,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 05:07:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:53,845 INFO L225 Difference]: With dead ends: 836 [2023-11-19 05:07:53,846 INFO L226 Difference]: Without dead ends: 784 [2023-11-19 05:07:53,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-19 05:07:53,848 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:53,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 17 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:07:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2023-11-19 05:07:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 678. [2023-11-19 05:07:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 2.918759231905465) internal successors, (1976), 677 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1976 transitions. [2023-11-19 05:07:53,888 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1976 transitions. Word has length 14 [2023-11-19 05:07:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:53,888 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1976 transitions. [2023-11-19 05:07:53,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1976 transitions. [2023-11-19 05:07:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:07:53,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:53,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:53,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:07:53,892 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:53,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash 413940304, now seen corresponding path program 2 times [2023-11-19 05:07:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914004465] [2023-11-19 05:07:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:53,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:54,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:54,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914004465] [2023-11-19 05:07:54,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914004465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:54,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:54,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:07:54,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544349099] [2023-11-19 05:07:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:54,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:07:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:54,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:07:54,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:07:54,379 INFO L87 Difference]: Start difference. First operand 678 states and 1976 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:54,606 INFO L93 Difference]: Finished difference Result 811 states and 2319 transitions. [2023-11-19 05:07:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:07:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 05:07:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:54,617 INFO L225 Difference]: With dead ends: 811 [2023-11-19 05:07:54,617 INFO L226 Difference]: Without dead ends: 740 [2023-11-19 05:07:54,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:07:54,619 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 55 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:54,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 15 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:07:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2023-11-19 05:07:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 694. [2023-11-19 05:07:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 2.907647907647908) internal successors, (2015), 693 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 2015 transitions. [2023-11-19 05:07:54,657 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 2015 transitions. Word has length 14 [2023-11-19 05:07:54,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:54,658 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 2015 transitions. [2023-11-19 05:07:54,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 2015 transitions. [2023-11-19 05:07:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:07:54,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:54,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:54,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 05:07:54,662 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:54,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1558201082, now seen corresponding path program 2 times [2023-11-19 05:07:54,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:54,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554379065] [2023-11-19 05:07:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:55,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554379065] [2023-11-19 05:07:55,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554379065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:55,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:07:55,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184148992] [2023-11-19 05:07:55,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:55,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:07:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:55,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:07:55,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:07:55,356 INFO L87 Difference]: Start difference. First operand 694 states and 2015 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:55,625 INFO L93 Difference]: Finished difference Result 724 states and 2064 transitions. [2023-11-19 05:07:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:07:55,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 05:07:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:55,633 INFO L225 Difference]: With dead ends: 724 [2023-11-19 05:07:55,634 INFO L226 Difference]: Without dead ends: 674 [2023-11-19 05:07:55,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:07:55,635 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:55,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 19 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:07:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-11-19 05:07:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 659. [2023-11-19 05:07:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 2.9103343465045595) internal successors, (1915), 658 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1915 transitions. [2023-11-19 05:07:55,743 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1915 transitions. Word has length 14 [2023-11-19 05:07:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:55,744 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 1915 transitions. [2023-11-19 05:07:55,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1915 transitions. [2023-11-19 05:07:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:07:55,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:55,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:55,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 05:07:55,756 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:55,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1646560072, now seen corresponding path program 1 times [2023-11-19 05:07:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007327719] [2023-11-19 05:07:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:56,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007327719] [2023-11-19 05:07:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007327719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:56,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:56,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:07:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811009406] [2023-11-19 05:07:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:56,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:07:56,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:56,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:07:56,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:07:56,035 INFO L87 Difference]: Start difference. First operand 659 states and 1915 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:56,197 INFO L93 Difference]: Finished difference Result 1039 states and 2904 transitions. [2023-11-19 05:07:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:07:56,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 05:07:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:56,205 INFO L225 Difference]: With dead ends: 1039 [2023-11-19 05:07:56,206 INFO L226 Difference]: Without dead ends: 687 [2023-11-19 05:07:56,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:07:56,209 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:56,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 16 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:07:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-11-19 05:07:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 613. [2023-11-19 05:07:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 2.761437908496732) internal successors, (1690), 612 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1690 transitions. [2023-11-19 05:07:56,241 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1690 transitions. Word has length 14 [2023-11-19 05:07:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:56,241 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 1690 transitions. [2023-11-19 05:07:56,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1690 transitions. [2023-11-19 05:07:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:07:56,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:56,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:56,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 05:07:56,245 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:56,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:56,246 INFO L85 PathProgramCache]: Analyzing trace with hash 913207921, now seen corresponding path program 1 times [2023-11-19 05:07:56,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:56,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111174407] [2023-11-19 05:07:56,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:56,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:57,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111174407] [2023-11-19 05:07:57,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111174407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:57,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:57,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:07:57,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274047957] [2023-11-19 05:07:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:57,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:07:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:57,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:07:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:07:57,366 INFO L87 Difference]: Start difference. First operand 613 states and 1690 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:57,700 INFO L93 Difference]: Finished difference Result 658 states and 1786 transitions. [2023-11-19 05:07:57,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:07:57,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 05:07:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:57,708 INFO L225 Difference]: With dead ends: 658 [2023-11-19 05:07:57,708 INFO L226 Difference]: Without dead ends: 626 [2023-11-19 05:07:57,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:07:57,710 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:57,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 22 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:07:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-11-19 05:07:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 589. [2023-11-19 05:07:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 2.772108843537415) internal successors, (1630), 588 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1630 transitions. [2023-11-19 05:07:57,745 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1630 transitions. Word has length 15 [2023-11-19 05:07:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:57,745 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 1630 transitions. [2023-11-19 05:07:57,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1630 transitions. [2023-11-19 05:07:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:07:57,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:57,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:57,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 05:07:57,749 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:57,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -110857023, now seen corresponding path program 1 times [2023-11-19 05:07:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059573747] [2023-11-19 05:07:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:07:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:07:59,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:07:59,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059573747] [2023-11-19 05:07:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059573747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:07:59,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:07:59,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:07:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565029160] [2023-11-19 05:07:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:07:59,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:07:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:07:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:07:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:07:59,118 INFO L87 Difference]: Start difference. First operand 589 states and 1630 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:07:59,717 INFO L93 Difference]: Finished difference Result 777 states and 2101 transitions. [2023-11-19 05:07:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 05:07:59,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 05:07:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:07:59,725 INFO L225 Difference]: With dead ends: 777 [2023-11-19 05:07:59,726 INFO L226 Difference]: Without dead ends: 721 [2023-11-19 05:07:59,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-11-19 05:07:59,727 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:07:59,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 28 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 05:07:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2023-11-19 05:07:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 600. [2023-11-19 05:07:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 2.7562604340567614) internal successors, (1651), 599 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1651 transitions. [2023-11-19 05:07:59,784 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1651 transitions. Word has length 15 [2023-11-19 05:07:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:07:59,787 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 1651 transitions. [2023-11-19 05:07:59,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:07:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1651 transitions. [2023-11-19 05:07:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:07:59,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:07:59,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:07:59,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 05:07:59,791 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:07:59,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:07:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash -109069563, now seen corresponding path program 2 times [2023-11-19 05:07:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:07:59,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081386054] [2023-11-19 05:07:59,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:07:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:07:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:08:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:08:00,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:08:00,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081386054] [2023-11-19 05:08:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081386054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:08:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:08:00,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:08:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708652931] [2023-11-19 05:08:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:08:00,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:08:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:08:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:08:00,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:08:00,552 INFO L87 Difference]: Start difference. First operand 600 states and 1651 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:08:00,965 INFO L93 Difference]: Finished difference Result 672 states and 1785 transitions. [2023-11-19 05:08:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:08:00,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 05:08:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:08:00,972 INFO L225 Difference]: With dead ends: 672 [2023-11-19 05:08:00,972 INFO L226 Difference]: Without dead ends: 517 [2023-11-19 05:08:00,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:08:00,973 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 57 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:08:00,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 35 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:08:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-11-19 05:08:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 509. [2023-11-19 05:08:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 2.6830708661417324) internal successors, (1363), 508 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1363 transitions. [2023-11-19 05:08:00,998 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1363 transitions. Word has length 15 [2023-11-19 05:08:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:08:00,998 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 1363 transitions. [2023-11-19 05:08:00,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1363 transitions. [2023-11-19 05:08:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:08:01,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:08:01,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:08:01,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 05:08:01,004 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:08:01,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:08:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 496283183, now seen corresponding path program 1 times [2023-11-19 05:08:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:08:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416339573] [2023-11-19 05:08:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:08:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:08:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:08:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:08:01,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:08:01,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416339573] [2023-11-19 05:08:01,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416339573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:08:01,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:08:01,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:08:01,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807261105] [2023-11-19 05:08:01,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:08:01,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:08:01,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:08:01,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:08:01,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:08:01,268 INFO L87 Difference]: Start difference. First operand 509 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:08:01,337 INFO L93 Difference]: Finished difference Result 363 states and 837 transitions. [2023-11-19 05:08:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:08:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 05:08:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:08:01,341 INFO L225 Difference]: With dead ends: 363 [2023-11-19 05:08:01,341 INFO L226 Difference]: Without dead ends: 363 [2023-11-19 05:08:01,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:08:01,342 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:08:01,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:08:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-11-19 05:08:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2023-11-19 05:08:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.3121546961325965) internal successors, (837), 362 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 837 transitions. [2023-11-19 05:08:01,372 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 837 transitions. Word has length 15 [2023-11-19 05:08:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:08:01,372 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 837 transitions. [2023-11-19 05:08:01,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 837 transitions. [2023-11-19 05:08:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:08:01,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:08:01,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:08:01,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 05:08:01,375 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:08:01,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:08:01,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1152221149, now seen corresponding path program 1 times [2023-11-19 05:08:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:08:01,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230634888] [2023-11-19 05:08:01,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:08:01,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:08:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:08:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:08:01,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:08:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230634888] [2023-11-19 05:08:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230634888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:08:01,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:08:01,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:08:01,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939010277] [2023-11-19 05:08:01,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:08:01,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:08:01,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:08:01,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:08:01,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:08:01,586 INFO L87 Difference]: Start difference. First operand 363 states and 837 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:08:01,686 INFO L93 Difference]: Finished difference Result 225 states and 455 transitions. [2023-11-19 05:08:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:08:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-19 05:08:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:08:01,689 INFO L225 Difference]: With dead ends: 225 [2023-11-19 05:08:01,689 INFO L226 Difference]: Without dead ends: 225 [2023-11-19 05:08:01,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:08:01,690 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:08:01,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:08:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-19 05:08:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 215. [2023-11-19 05:08:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.02803738317757) internal successors, (434), 214 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 434 transitions. [2023-11-19 05:08:01,701 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 434 transitions. Word has length 16 [2023-11-19 05:08:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:08:01,701 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 434 transitions. [2023-11-19 05:08:01,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 434 transitions. [2023-11-19 05:08:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:08:01,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:08:01,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:08:01,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 05:08:01,708 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:08:01,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:08:01,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1297800291, now seen corresponding path program 1 times [2023-11-19 05:08:01,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:08:01,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514564719] [2023-11-19 05:08:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:08:01,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:08:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:08:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:08:03,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:08:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514564719] [2023-11-19 05:08:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514564719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:08:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:08:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:08:03,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572429758] [2023-11-19 05:08:03,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:08:03,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 05:08:03,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:08:03,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 05:08:03,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:08:03,104 INFO L87 Difference]: Start difference. First operand 215 states and 434 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:08:03,482 INFO L93 Difference]: Finished difference Result 239 states and 470 transitions. [2023-11-19 05:08:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:08:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:08:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:08:03,485 INFO L225 Difference]: With dead ends: 239 [2023-11-19 05:08:03,485 INFO L226 Difference]: Without dead ends: 225 [2023-11-19 05:08:03,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:08:03,486 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:08:03,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 26 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:08:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-19 05:08:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 213. [2023-11-19 05:08:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.0283018867924527) internal successors, (430), 212 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 430 transitions. [2023-11-19 05:08:03,495 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 430 transitions. Word has length 19 [2023-11-19 05:08:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:08:03,496 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 430 transitions. [2023-11-19 05:08:03,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 430 transitions. [2023-11-19 05:08:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:08:03,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:08:03,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:08:03,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 05:08:03,498 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:08:03,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:08:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2016251755, now seen corresponding path program 2 times [2023-11-19 05:08:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:08:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913847519] [2023-11-19 05:08:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:08:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:08:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:08:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:08:05,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:08:05,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913847519] [2023-11-19 05:08:05,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913847519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:08:05,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:08:05,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:08:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219974637] [2023-11-19 05:08:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:08:05,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 05:08:05,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:08:05,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 05:08:05,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:08:05,153 INFO L87 Difference]: Start difference. First operand 213 states and 430 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:08:05,471 INFO L93 Difference]: Finished difference Result 240 states and 472 transitions. [2023-11-19 05:08:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 05:08:05,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:08:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:08:05,474 INFO L225 Difference]: With dead ends: 240 [2023-11-19 05:08:05,474 INFO L226 Difference]: Without dead ends: 224 [2023-11-19 05:08:05,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-19 05:08:05,475 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:08:05,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 17 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:08:05,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-19 05:08:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2023-11-19 05:08:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.028436018957346) internal successors, (428), 211 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 428 transitions. [2023-11-19 05:08:05,488 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 428 transitions. Word has length 19 [2023-11-19 05:08:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:08:05,488 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 428 transitions. [2023-11-19 05:08:05,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 428 transitions. [2023-11-19 05:08:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:08:05,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:08:05,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:08:05,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 05:08:05,493 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:08:05,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:08:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash 426317005, now seen corresponding path program 3 times [2023-11-19 05:08:05,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:08:05,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824948446] [2023-11-19 05:08:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:08:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:08:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:08:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:08:06,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:08:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824948446] [2023-11-19 05:08:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824948446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:08:06,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:08:06,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 05:08:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108157075] [2023-11-19 05:08:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:08:06,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 05:08:06,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:08:06,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 05:08:06,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:08:06,871 INFO L87 Difference]: Start difference. First operand 212 states and 428 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:08:07,268 INFO L93 Difference]: Finished difference Result 277 states and 537 transitions. [2023-11-19 05:08:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:08:07,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:08:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:08:07,270 INFO L225 Difference]: With dead ends: 277 [2023-11-19 05:08:07,270 INFO L226 Difference]: Without dead ends: 177 [2023-11-19 05:08:07,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:08:07,272 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:08:07,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 25 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:08:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-19 05:08:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 165. [2023-11-19 05:08:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.9878048780487805) internal successors, (326), 164 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 326 transitions. [2023-11-19 05:08:07,279 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 326 transitions. Word has length 19 [2023-11-19 05:08:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:08:07,279 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 326 transitions. [2023-11-19 05:08:07,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 326 transitions. [2023-11-19 05:08:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:08:07,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:08:07,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:08:07,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-19 05:08:07,281 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:08:07,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:08:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash 911695646, now seen corresponding path program 1 times [2023-11-19 05:08:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:08:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000167633] [2023-11-19 05:08:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:08:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:08:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:08:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:08:07,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:08:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000167633] [2023-11-19 05:08:07,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000167633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:08:07,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:08:07,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:08:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722446665] [2023-11-19 05:08:07,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:08:07,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:08:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:08:07,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:08:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:08:07,528 INFO L87 Difference]: Start difference. First operand 165 states and 326 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:08:07,632 INFO L93 Difference]: Finished difference Result 131 states and 262 transitions. [2023-11-19 05:08:07,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:08:07,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:08:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:08:07,633 INFO L225 Difference]: With dead ends: 131 [2023-11-19 05:08:07,633 INFO L226 Difference]: Without dead ends: 63 [2023-11-19 05:08:07,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:08:07,634 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:08:07,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 6 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:08:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-19 05:08:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-19 05:08:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 62 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2023-11-19 05:08:07,640 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2023-11-19 05:08:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:08:07,640 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2023-11-19 05:08:07,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:08:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2023-11-19 05:08:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:08:07,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:08:07,641 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] [2023-11-19 05:08:07,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-19 05:08:07,642 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 05:08:07,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:08:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 561049746, now seen corresponding path program 1 times [2023-11-19 05:08:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:08:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910855447] [2023-11-19 05:08:07,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:08:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:08:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:08:07,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 05:08:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:08:07,896 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 05:08:07,896 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 05:08:07,898 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 05:08:07,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 05:08:07,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 05:08:07,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 05:08:07,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 05:08:07,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 05:08:07,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 05:08:07,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 05:08:07,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 05:08:07,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 05:08:07,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 05:08:07,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 05:08:07,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 05:08:07,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-19 05:08:07,906 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:08:07,914 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 05:08:07,914 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:08:07,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 05:08:07,998 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 05:08:08,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 05:08:08,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 05:08:08,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:08:08 BasicIcfg [2023-11-19 05:08:08,044 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:08:08,045 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:08:08,045 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:08:08,045 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:08:08,046 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:07:35" (3/4) ... [2023-11-19 05:08:08,048 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 05:08:08,050 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:08:08,050 INFO L158 Benchmark]: Toolchain (without parser) took 34409.30ms. Allocated memory was 188.7MB in the beginning and 478.2MB in the end (delta: 289.4MB). Free memory was 141.1MB in the beginning and 280.4MB in the end (delta: -139.3MB). Peak memory consumption was 153.2MB. Max. memory is 16.1GB. [2023-11-19 05:08:08,051 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 123.7MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:08:08,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 901.03ms. Allocated memory is still 188.7MB. Free memory was 141.1MB in the beginning and 117.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 05:08:08,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.01ms. Allocated memory is still 188.7MB. Free memory was 117.6MB in the beginning and 115.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:08:08,052 INFO L158 Benchmark]: Boogie Preprocessor took 71.93ms. Allocated memory is still 188.7MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:08:08,053 INFO L158 Benchmark]: RCFGBuilder took 1188.67ms. Allocated memory is still 188.7MB. Free memory was 113.0MB in the beginning and 128.9MB in the end (delta: -16.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2023-11-19 05:08:08,053 INFO L158 Benchmark]: TraceAbstraction took 32108.56ms. Allocated memory was 188.7MB in the beginning and 478.2MB in the end (delta: 289.4MB). Free memory was 128.3MB in the beginning and 280.4MB in the end (delta: -152.1MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. [2023-11-19 05:08:08,054 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 478.2MB. Free memory is still 280.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:08:08,056 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 123.7MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 901.03ms. Allocated memory is still 188.7MB. Free memory was 141.1MB in the beginning and 117.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.01ms. Allocated memory is still 188.7MB. Free memory was 117.6MB in the beginning and 115.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.93ms. Allocated memory is still 188.7MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1188.67ms. Allocated memory is still 188.7MB. Free memory was 113.0MB in the beginning and 128.9MB in the end (delta: -16.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32108.56ms. Allocated memory was 188.7MB in the beginning and 478.2MB in the end (delta: 289.4MB). Free memory was 128.3MB in the beginning and 280.4MB in the end (delta: -152.1MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 478.2MB. Free memory is still 280.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 131 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 35 TransitionsAfterwards, 2686 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 128 TotalNumberOfCompositions, 6120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3014, independent: 2872, independent conditional: 0, independent unconditional: 2872, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1723, independent: 1682, independent conditional: 0, independent unconditional: 1682, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1723, independent: 1661, independent conditional: 0, independent unconditional: 1661, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 501, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 453, dependent conditional: 0, dependent unconditional: 453, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3014, independent: 1190, independent conditional: 0, independent unconditional: 1190, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 1723, unknown conditional: 0, unknown unconditional: 1723] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L788] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 782 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2692 IncrementalHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 132 mSDtfsCounter, 2692 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1098occurred in iteration=0, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 769 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 3627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 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 [2023-11-19 05:08:08,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:08:11,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:08:11,465 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-19 05:08:11,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:08:11,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:08:11,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:08:11,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:08:11,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:08:11,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:08:11,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:08:11,546 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:08:11,547 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:08:11,547 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:08:11,550 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:08:11,550 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:08:11,551 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:08:11,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:08:11,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:08:11,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:08:11,555 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:08:11,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:08:11,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:08:11,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:08:11,557 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:08:11,558 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:08:11,558 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:08:11,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:08:11,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:08:11,560 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 05:08:11,561 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 05:08:11,563 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:08:11,563 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:08:11,563 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:08:11,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:08:11,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 05:08:11,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:08:11,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:08:11,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:08:11,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:08:11,567 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-19 05:08:11,567 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 05:08:11,568 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:08:11,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:08:11,568 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2023-11-19 05:08:12,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:08:12,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:08:12,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:08:12,057 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:08:12,058 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:08:12,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86909d65-01a3-4da3-b98e-ed9ad091757a/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i