./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5 --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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 19:43:30,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:43:30,705 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-21 19:43:30,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:43:30,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:43:30,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:43:30,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:43:30,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:43:30,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:43:30,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:43:30,765 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-21 19:43:30,765 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-21 19:43:30,766 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-21 19:43:30,767 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-21 19:43:30,768 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-21 19:43:30,768 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-21 19:43:30,769 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-21 19:43:30,769 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-21 19:43:30,770 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-21 19:43:30,770 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-21 19:43:30,770 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-21 19:43:30,771 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-21 19:43:30,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:43:30,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:43:30,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:43:30,773 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:43:30,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:43:30,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:43:30,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:43:30,775 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 19:43:30,776 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 19:43:30,776 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 19:43:30,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:43:30,777 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 19:43:30,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:43:30,777 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:43:30,777 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:43:30,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:43:30,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 19:43:30,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:43:30,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:43:30,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:43:30,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:43:30,779 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-21 19:43:30,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:43:30,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:43:30,780 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-21 19:43:30,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 19:43:30,781 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_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/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_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5 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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2023-11-21 19:43:31,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:43:31,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:43:31,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:43:31,062 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:43:31,062 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:43:31,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 19:43:34,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:43:34,644 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:43:34,645 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 19:43:34,664 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/data/380072707/bc6ef856f8ee4482aa42317e27d9ad4f/FLAG38d5aca62 [2023-11-21 19:43:34,684 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/data/380072707/bc6ef856f8ee4482aa42317e27d9ad4f [2023-11-21 19:43:34,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:43:34,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:43:34,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:43:34,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:43:34,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:43:34,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:43:34" (1/1) ... [2023-11-21 19:43:34,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e05afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:34, skipping insertion in model container [2023-11-21 19:43:34,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:43:34" (1/1) ... [2023-11-21 19:43:34,762 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:43:35,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:43:35,255 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:43:35,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:43:35,433 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:43:35,433 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:43:35,441 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:43:35,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35 WrapperNode [2023-11-21 19:43:35,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:43:35,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:43:35,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:43:35,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:43:35,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,542 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-21 19:43:35,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:43:35,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:43:35,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:43:35,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:43:35,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:43:35,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:43:35,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:43:35,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:43:35,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (1/1) ... [2023-11-21 19:43:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:43:35,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 19:43:35,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 19:43:35,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 19:43:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 19:43:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 19:43:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 19:43:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:43:35,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:43:35,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 19:43:35,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 19:43:35,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 19:43:35,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 19:43:35,745 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 19:43:35,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 19:43:35,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 19:43:35,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 19:43:35,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:43:35,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:43:35,750 WARN L212 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 19:43:35,963 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:43:35,966 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:43:36,497 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:43:36,896 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:43:36,897 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 19:43:36,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:43:36 BoogieIcfgContainer [2023-11-21 19:43:36,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:43:36,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:43:36,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:43:36,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:43:36,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:43:34" (1/3) ... [2023-11-21 19:43:36,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711fd504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:43:36, skipping insertion in model container [2023-11-21 19:43:36,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:43:35" (2/3) ... [2023-11-21 19:43:36,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@711fd504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:43:36, skipping insertion in model container [2023-11-21 19:43:36,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:43:36" (3/3) ... [2023-11-21 19:43:36,912 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 19:43:36,931 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:43:36,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-21 19:43:36,932 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:43:37,006 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:43:37,042 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 54 transitions, 120 flow [2023-11-21 19:43:37,485 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 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-21 19:43:37,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 19:43:37,518 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;@42a9e29f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:43:37,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-21 19:43:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 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-21 19:43:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 19:43:37,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:37,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 19:43:37,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:37,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash 14771, now seen corresponding path program 1 times [2023-11-21 19:43:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:37,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108812505] [2023-11-21 19:43:37,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:37,883 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-21 19:43:37,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:37,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108812505] [2023-11-21 19:43:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108812505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:37,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:43:37,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718451426] [2023-11-21 19:43:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:37,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:43:37,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:37,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:43:37,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:43:37,948 INFO L87 Difference]: Start difference. First operand has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 19:43:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:38,322 INFO L93 Difference]: Finished difference Result 6356 states and 22090 transitions. [2023-11-21 19:43:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:43:38,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 19:43:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:38,455 INFO L225 Difference]: With dead ends: 6356 [2023-11-21 19:43:38,455 INFO L226 Difference]: Without dead ends: 6356 [2023-11-21 19:43:38,463 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-21 19:43:38,470 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:38,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:38,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6356 states. [2023-11-21 19:43:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6356 to 6356. [2023-11-21 19:43:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6356 states, 6344 states have (on average 3.48203026481715) internal successors, (22090), 6355 states have internal predecessors, (22090), 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-21 19:43:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6356 states to 6356 states and 22090 transitions. [2023-11-21 19:43:38,972 INFO L78 Accepts]: Start accepts. Automaton has 6356 states and 22090 transitions. Word has length 2 [2023-11-21 19:43:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:38,973 INFO L495 AbstractCegarLoop]: Abstraction has 6356 states and 22090 transitions. [2023-11-21 19:43:38,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 19:43:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6356 states and 22090 transitions. [2023-11-21 19:43:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 19:43:38,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:38,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 19:43:38,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:43:38,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:38,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 14772, now seen corresponding path program 1 times [2023-11-21 19:43:38,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553313181] [2023-11-21 19:43:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:38,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:39,221 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-21 19:43:39,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553313181] [2023-11-21 19:43:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553313181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:39,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:39,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:43:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403213306] [2023-11-21 19:43:39,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:39,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:43:39,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:39,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:43:39,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:43:39,226 INFO L87 Difference]: Start difference. First operand 6356 states and 22090 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 19:43:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:39,427 INFO L93 Difference]: Finished difference Result 6355 states and 22089 transitions. [2023-11-21 19:43:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:43:39,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 19:43:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:39,569 INFO L225 Difference]: With dead ends: 6355 [2023-11-21 19:43:39,569 INFO L226 Difference]: Without dead ends: 6355 [2023-11-21 19:43:39,574 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-21 19:43:39,576 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:39,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 26 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2023-11-21 19:43:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 6355. [2023-11-21 19:43:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6355 states, 6344 states have (on average 3.4818726355611602) internal successors, (22089), 6354 states have internal predecessors, (22089), 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-21 19:43:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6355 states to 6355 states and 22089 transitions. [2023-11-21 19:43:39,903 INFO L78 Accepts]: Start accepts. Automaton has 6355 states and 22089 transitions. Word has length 2 [2023-11-21 19:43:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:39,904 INFO L495 AbstractCegarLoop]: Abstraction has 6355 states and 22089 transitions. [2023-11-21 19:43:39,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 19:43:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 6355 states and 22089 transitions. [2023-11-21 19:43:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 19:43:39,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:39,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 19:43:39,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 19:43:39,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:39,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash 440491918, now seen corresponding path program 1 times [2023-11-21 19:43:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505396624] [2023-11-21 19:43:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:39,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:40,025 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-21 19:43:40,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505396624] [2023-11-21 19:43:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505396624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:40,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:40,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:43:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286107282] [2023-11-21 19:43:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:40,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:43:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:40,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:43:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:43:40,037 INFO L87 Difference]: Start difference. First operand 6355 states and 22089 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-21 19:43:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:40,280 INFO L93 Difference]: Finished difference Result 6347 states and 22074 transitions. [2023-11-21 19:43:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:43:40,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-21 19:43:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:40,346 INFO L225 Difference]: With dead ends: 6347 [2023-11-21 19:43:40,346 INFO L226 Difference]: Without dead ends: 6347 [2023-11-21 19:43:40,347 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-21 19:43:40,354 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:40,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2023-11-21 19:43:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 6347. [2023-11-21 19:43:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6337 states have (on average 3.4833517437273156) internal successors, (22074), 6346 states have internal predecessors, (22074), 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-21 19:43:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 22074 transitions. [2023-11-21 19:43:40,718 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 22074 transitions. Word has length 5 [2023-11-21 19:43:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:40,719 INFO L495 AbstractCegarLoop]: Abstraction has 6347 states and 22074 transitions. [2023-11-21 19:43:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-21 19:43:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 22074 transitions. [2023-11-21 19:43:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 19:43:40,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:40,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 19:43:40,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 19:43:40,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:40,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash 440491919, now seen corresponding path program 1 times [2023-11-21 19:43:40,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:40,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38336390] [2023-11-21 19:43:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:40,845 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-21 19:43:40,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38336390] [2023-11-21 19:43:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38336390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:43:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837099604] [2023-11-21 19:43:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:40,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:43:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:40,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:43:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:43:40,848 INFO L87 Difference]: Start difference. First operand 6347 states and 22074 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-21 19:43:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:41,017 INFO L93 Difference]: Finished difference Result 6339 states and 22059 transitions. [2023-11-21 19:43:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:43:41,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-21 19:43:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:41,052 INFO L225 Difference]: With dead ends: 6339 [2023-11-21 19:43:41,053 INFO L226 Difference]: Without dead ends: 6339 [2023-11-21 19:43:41,053 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-21 19:43:41,061 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:41,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2023-11-21 19:43:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 6339. [2023-11-21 19:43:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6330 states have (on average 3.4848341232227487) internal successors, (22059), 6338 states have internal predecessors, (22059), 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-21 19:43:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 22059 transitions. [2023-11-21 19:43:41,470 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 22059 transitions. Word has length 5 [2023-11-21 19:43:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:41,470 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 22059 transitions. [2023-11-21 19:43:41,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-21 19:43:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 22059 transitions. [2023-11-21 19:43:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 19:43:41,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:41,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:41,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 19:43:41,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:41,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1570092919, now seen corresponding path program 1 times [2023-11-21 19:43:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711692615] [2023-11-21 19:43:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:41,545 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-21 19:43:41,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:41,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711692615] [2023-11-21 19:43:41,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711692615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:41,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:41,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:43:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189583971] [2023-11-21 19:43:41,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:41,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:43:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:43:41,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:43:41,548 INFO L87 Difference]: Start difference. First operand 6339 states and 22059 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 19:43:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:41,696 INFO L93 Difference]: Finished difference Result 6275 states and 21883 transitions. [2023-11-21 19:43:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:43:41,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-11-21 19:43:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:41,729 INFO L225 Difference]: With dead ends: 6275 [2023-11-21 19:43:41,729 INFO L226 Difference]: Without dead ends: 6275 [2023-11-21 19:43:41,729 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-21 19:43:41,730 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:41,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 31 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2023-11-21 19:43:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 6275. [2023-11-21 19:43:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6275 states, 6268 states have (on average 3.4912252712188896) internal successors, (21883), 6274 states have internal predecessors, (21883), 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-21 19:43:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6275 states to 6275 states and 21883 transitions. [2023-11-21 19:43:42,130 INFO L78 Accepts]: Start accepts. Automaton has 6275 states and 21883 transitions. Word has length 8 [2023-11-21 19:43:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:42,131 INFO L495 AbstractCegarLoop]: Abstraction has 6275 states and 21883 transitions. [2023-11-21 19:43:42,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 19:43:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6275 states and 21883 transitions. [2023-11-21 19:43:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 19:43:42,133 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:42,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:42,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 19:43:42,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:42,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1570092920, now seen corresponding path program 1 times [2023-11-21 19:43:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:42,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338306084] [2023-11-21 19:43:42,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:42,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:42,235 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-21 19:43:42,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:42,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338306084] [2023-11-21 19:43:42,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338306084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:42,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:42,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:43:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165279758] [2023-11-21 19:43:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:42,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:43:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:43:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:43:42,239 INFO L87 Difference]: Start difference. First operand 6275 states and 21883 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 19:43:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:42,469 INFO L93 Difference]: Finished difference Result 6211 states and 21707 transitions. [2023-11-21 19:43:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:43:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-11-21 19:43:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:42,501 INFO L225 Difference]: With dead ends: 6211 [2023-11-21 19:43:42,501 INFO L226 Difference]: Without dead ends: 6211 [2023-11-21 19:43:42,501 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-21 19:43:42,502 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:42,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 32 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6211 states. [2023-11-21 19:43:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6211 to 6211. [2023-11-21 19:43:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6211 states, 6206 states have (on average 3.497744118594908) internal successors, (21707), 6210 states have internal predecessors, (21707), 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-21 19:43:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 21707 transitions. [2023-11-21 19:43:42,707 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 21707 transitions. Word has length 8 [2023-11-21 19:43:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:42,707 INFO L495 AbstractCegarLoop]: Abstraction has 6211 states and 21707 transitions. [2023-11-21 19:43:42,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 19:43:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 21707 transitions. [2023-11-21 19:43:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 19:43:42,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:42,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:42,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 19:43:42,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:42,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1570094076, now seen corresponding path program 1 times [2023-11-21 19:43:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:42,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444866782] [2023-11-21 19:43:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:42,825 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-21 19:43:42,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:42,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444866782] [2023-11-21 19:43:42,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444866782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:42,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:42,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:43:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540577458] [2023-11-21 19:43:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:42,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:43:42,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:43:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:43:42,828 INFO L87 Difference]: Start difference. First operand 6211 states and 21707 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-21 19:43:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:43,027 INFO L93 Difference]: Finished difference Result 5403 states and 18768 transitions. [2023-11-21 19:43:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:43:43,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-21 19:43:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:43,053 INFO L225 Difference]: With dead ends: 5403 [2023-11-21 19:43:43,053 INFO L226 Difference]: Without dead ends: 5291 [2023-11-21 19:43:43,054 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-21 19:43:43,055 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:43,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2023-11-21 19:43:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5291. [2023-11-21 19:43:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5289 states have (on average 3.4800529400642843) internal successors, (18406), 5290 states have internal predecessors, (18406), 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-21 19:43:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 18406 transitions. [2023-11-21 19:43:43,220 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 18406 transitions. Word has length 8 [2023-11-21 19:43:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:43,220 INFO L495 AbstractCegarLoop]: Abstraction has 5291 states and 18406 transitions. [2023-11-21 19:43:43,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-21 19:43:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 18406 transitions. [2023-11-21 19:43:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 19:43:43,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:43,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 19:43:43,229 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:43,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1928705787, now seen corresponding path program 1 times [2023-11-21 19:43:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:43,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348566072] [2023-11-21 19:43:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:43,926 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-21 19:43:43,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348566072] [2023-11-21 19:43:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348566072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:43:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604065246] [2023-11-21 19:43:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:43,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 19:43:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:43,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 19:43:43,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-21 19:43:43,929 INFO L87 Difference]: Start difference. First operand 5291 states and 18406 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-21 19:43:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:44,345 INFO L93 Difference]: Finished difference Result 7503 states and 25776 transitions. [2023-11-21 19:43:44,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 19:43:44,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2023-11-21 19:43:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:44,375 INFO L225 Difference]: With dead ends: 7503 [2023-11-21 19:43:44,376 INFO L226 Difference]: Without dead ends: 6719 [2023-11-21 19:43:44,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:43:44,377 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:44,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 165 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 19:43:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6719 states. [2023-11-21 19:43:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6719 to 6131. [2023-11-21 19:43:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6131 states, 6129 states have (on average 3.4460760319791155) internal successors, (21121), 6130 states have internal predecessors, (21121), 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-21 19:43:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6131 states to 6131 states and 21121 transitions. [2023-11-21 19:43:44,599 INFO L78 Accepts]: Start accepts. Automaton has 6131 states and 21121 transitions. Word has length 18 [2023-11-21 19:43:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:44,600 INFO L495 AbstractCegarLoop]: Abstraction has 6131 states and 21121 transitions. [2023-11-21 19:43:44,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-21 19:43:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6131 states and 21121 transitions. [2023-11-21 19:43:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 19:43:44,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:44,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:44,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 19:43:44,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:44,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1928706103, now seen corresponding path program 1 times [2023-11-21 19:43:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:44,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374950230] [2023-11-21 19:43:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:44,808 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-21 19:43:44,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:44,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374950230] [2023-11-21 19:43:44,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374950230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:44,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:44,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 19:43:44,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567626300] [2023-11-21 19:43:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:44,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 19:43:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 19:43:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 19:43:44,813 INFO L87 Difference]: Start difference. First operand 6131 states and 21121 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-21 19:43:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:45,052 INFO L93 Difference]: Finished difference Result 5119 states and 16369 transitions. [2023-11-21 19:43:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 19:43:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2023-11-21 19:43:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:45,074 INFO L225 Difference]: With dead ends: 5119 [2023-11-21 19:43:45,074 INFO L226 Difference]: Without dead ends: 4531 [2023-11-21 19:43:45,074 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-21 19:43:45,077 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 65 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:45,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 38 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2023-11-21 19:43:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4531. [2023-11-21 19:43:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 4529 states have (on average 3.239346434091411) internal successors, (14671), 4530 states have internal predecessors, (14671), 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-21 19:43:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 14671 transitions. [2023-11-21 19:43:45,269 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 14671 transitions. Word has length 18 [2023-11-21 19:43:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:45,270 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 14671 transitions. [2023-11-21 19:43:45,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-21 19:43:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 14671 transitions. [2023-11-21 19:43:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-21 19:43:45,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:45,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:45,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 19:43:45,279 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:45,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash -329922595, now seen corresponding path program 1 times [2023-11-21 19:43:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:45,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889098479] [2023-11-21 19:43:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:45,642 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-21 19:43:45,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889098479] [2023-11-21 19:43:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889098479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:45,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:43:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598687408] [2023-11-21 19:43:45,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:45,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:43:45,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:45,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:43:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:43:45,647 INFO L87 Difference]: Start difference. First operand 4531 states and 14671 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-21 19:43:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:45,849 INFO L93 Difference]: Finished difference Result 2839 states and 8459 transitions. [2023-11-21 19:43:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 19:43:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2023-11-21 19:43:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:45,861 INFO L225 Difference]: With dead ends: 2839 [2023-11-21 19:43:45,862 INFO L226 Difference]: Without dead ends: 2451 [2023-11-21 19:43:45,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-21 19:43:45,863 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 116 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:45,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 45 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:43:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2023-11-21 19:43:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2451. [2023-11-21 19:43:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2449 states have (on average 2.98121682319314) internal successors, (7301), 2450 states have internal predecessors, (7301), 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-21 19:43:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 7301 transitions. [2023-11-21 19:43:45,955 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 7301 transitions. Word has length 23 [2023-11-21 19:43:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:45,956 INFO L495 AbstractCegarLoop]: Abstraction has 2451 states and 7301 transitions. [2023-11-21 19:43:45,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-21 19:43:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 7301 transitions. [2023-11-21 19:43:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 19:43:45,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:45,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:45,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 19:43:45,967 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:45,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash 173021732, now seen corresponding path program 1 times [2023-11-21 19:43:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030005781] [2023-11-21 19:43:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:46,384 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-21 19:43:46,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030005781] [2023-11-21 19:43:46,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030005781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:46,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:46,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:43:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553596192] [2023-11-21 19:43:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:46,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:43:46,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:46,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:43:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:43:46,387 INFO L87 Difference]: Start difference. First operand 2451 states and 7301 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-21 19:43:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:46,583 INFO L93 Difference]: Finished difference Result 1683 states and 4925 transitions. [2023-11-21 19:43:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:43:46,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2023-11-21 19:43:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:46,591 INFO L225 Difference]: With dead ends: 1683 [2023-11-21 19:43:46,591 INFO L226 Difference]: Without dead ends: 1555 [2023-11-21 19:43:46,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:43:46,592 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 148 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:46,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 36 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:43:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2023-11-21 19:43:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2023-11-21 19:43:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1553 states have (on average 2.93947198969736) internal successors, (4565), 1554 states have internal predecessors, (4565), 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-21 19:43:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 4565 transitions. [2023-11-21 19:43:46,644 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 4565 transitions. Word has length 28 [2023-11-21 19:43:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:46,644 INFO L495 AbstractCegarLoop]: Abstraction has 1555 states and 4565 transitions. [2023-11-21 19:43:46,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-21 19:43:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 4565 transitions. [2023-11-21 19:43:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 19:43:46,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:46,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:46,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 19:43:46,651 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:46,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1440604769, now seen corresponding path program 1 times [2023-11-21 19:43:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902769613] [2023-11-21 19:43:46,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:49,128 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-21 19:43:49,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:49,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902769613] [2023-11-21 19:43:49,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902769613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:49,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:49,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 19:43:49,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179675429] [2023-11-21 19:43:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:49,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 19:43:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 19:43:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-21 19:43:49,132 INFO L87 Difference]: Start difference. First operand 1555 states and 4565 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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-21 19:43:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:49,798 INFO L93 Difference]: Finished difference Result 2781 states and 7988 transitions. [2023-11-21 19:43:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:43:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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 34 [2023-11-21 19:43:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:49,809 INFO L225 Difference]: With dead ends: 2781 [2023-11-21 19:43:49,809 INFO L226 Difference]: Without dead ends: 2101 [2023-11-21 19:43:49,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-21 19:43:49,811 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 165 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:49,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 189 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 19:43:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2023-11-21 19:43:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1805. [2023-11-21 19:43:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1803 states have (on average 2.8641153632834166) internal successors, (5164), 1804 states have internal predecessors, (5164), 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-21 19:43:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 5164 transitions. [2023-11-21 19:43:49,880 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 5164 transitions. Word has length 34 [2023-11-21 19:43:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:49,880 INFO L495 AbstractCegarLoop]: Abstraction has 1805 states and 5164 transitions. [2023-11-21 19:43:49,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 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-21 19:43:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 5164 transitions. [2023-11-21 19:43:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 19:43:49,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:49,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:49,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 19:43:49,888 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:49,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash 49509479, now seen corresponding path program 2 times [2023-11-21 19:43:49,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861988081] [2023-11-21 19:43:49,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:49,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:50,921 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-21 19:43:50,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861988081] [2023-11-21 19:43:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861988081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 19:43:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210388974] [2023-11-21 19:43:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:50,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 19:43:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 19:43:50,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-21 19:43:50,924 INFO L87 Difference]: Start difference. First operand 1805 states and 5164 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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-21 19:43:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:51,416 INFO L93 Difference]: Finished difference Result 3232 states and 9154 transitions. [2023-11-21 19:43:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:43:51,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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 34 [2023-11-21 19:43:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:51,427 INFO L225 Difference]: With dead ends: 3232 [2023-11-21 19:43:51,427 INFO L226 Difference]: Without dead ends: 2648 [2023-11-21 19:43:51,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-21 19:43:51,428 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:51,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 255 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 19:43:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2023-11-21 19:43:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1893. [2023-11-21 19:43:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1891 states have (on average 2.8635642517186675) internal successors, (5415), 1892 states have internal predecessors, (5415), 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-21 19:43:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 5415 transitions. [2023-11-21 19:43:51,483 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 5415 transitions. Word has length 34 [2023-11-21 19:43:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:51,483 INFO L495 AbstractCegarLoop]: Abstraction has 1893 states and 5415 transitions. [2023-11-21 19:43:51,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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-21 19:43:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 5415 transitions. [2023-11-21 19:43:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 19:43:51,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:51,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 19:43:51,490 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:51,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -705897345, now seen corresponding path program 3 times [2023-11-21 19:43:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:51,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113144800] [2023-11-21 19:43:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:53,465 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-21 19:43:53,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:53,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113144800] [2023-11-21 19:43:53,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113144800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:53,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:53,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-21 19:43:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217495780] [2023-11-21 19:43:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:53,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-21 19:43:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-21 19:43:53,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-21 19:43:53,468 INFO L87 Difference]: Start difference. First operand 1893 states and 5415 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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-21 19:43:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:54,319 INFO L93 Difference]: Finished difference Result 3801 states and 10771 transitions. [2023-11-21 19:43:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 19:43:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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 34 [2023-11-21 19:43:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:54,331 INFO L225 Difference]: With dead ends: 3801 [2023-11-21 19:43:54,331 INFO L226 Difference]: Without dead ends: 3409 [2023-11-21 19:43:54,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2023-11-21 19:43:54,333 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 270 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:54,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 235 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 19:43:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2023-11-21 19:43:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 1757. [2023-11-21 19:43:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1755 states have (on average 2.845014245014245) internal successors, (4993), 1756 states have internal predecessors, (4993), 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-21 19:43:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 4993 transitions. [2023-11-21 19:43:54,392 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 4993 transitions. Word has length 34 [2023-11-21 19:43:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:54,392 INFO L495 AbstractCegarLoop]: Abstraction has 1757 states and 4993 transitions. [2023-11-21 19:43:54,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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-21 19:43:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 4993 transitions. [2023-11-21 19:43:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 19:43:54,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:54,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:54,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 19:43:54,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:54,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash -771959903, now seen corresponding path program 4 times [2023-11-21 19:43:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133643765] [2023-11-21 19:43:54,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:43:57,003 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-21 19:43:57,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:43:57,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133643765] [2023-11-21 19:43:57,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133643765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:43:57,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:43:57,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-21 19:43:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47411987] [2023-11-21 19:43:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:43:57,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-21 19:43:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:43:57,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-21 19:43:57,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-21 19:43:57,006 INFO L87 Difference]: Start difference. First operand 1757 states and 4993 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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-21 19:43:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:43:57,734 INFO L93 Difference]: Finished difference Result 3095 states and 8696 transitions. [2023-11-21 19:43:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:43:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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 34 [2023-11-21 19:43:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:43:57,744 INFO L225 Difference]: With dead ends: 3095 [2023-11-21 19:43:57,745 INFO L226 Difference]: Without dead ends: 2719 [2023-11-21 19:43:57,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-11-21 19:43:57,746 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 149 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 19:43:57,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 219 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 19:43:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2023-11-21 19:43:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 1779. [2023-11-21 19:43:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1777 states have (on average 2.839054586381542) internal successors, (5045), 1778 states have internal predecessors, (5045), 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-21 19:43:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 5045 transitions. [2023-11-21 19:43:57,802 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 5045 transitions. Word has length 34 [2023-11-21 19:43:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:43:57,802 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 5045 transitions. [2023-11-21 19:43:57,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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-21 19:43:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 5045 transitions. [2023-11-21 19:43:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-21 19:43:57,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:43:57,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:57,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 19:43:57,809 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:43:57,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:43:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1499694375, now seen corresponding path program 5 times [2023-11-21 19:43:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:43:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140946264] [2023-11-21 19:43:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:43:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:43:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:43:57,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:43:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:43:58,058 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-21 19:43:58,061 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:43:58,063 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-21 19:43:58,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-21 19:43:58,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-21 19:43:58,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-21 19:43:58,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-21 19:43:58,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-21 19:43:58,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-21 19:43:58,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-21 19:43:58,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-21 19:43:58,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-21 19:43:58,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-21 19:43:58,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-21 19:43:58,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-21 19:43:58,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 19:43:58,074 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:43:58,081 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 19:43:58,081 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 19:43:58,160 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 19:43:58,163 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 19:43:58,174 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-21 19:43:58,186 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 19:43:58,194 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 19:43:58,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 07:43:58 BasicIcfg [2023-11-21 19:43:58,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 19:43:58,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 19:43:58,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 19:43:58,215 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 19:43:58,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:43:36" (3/4) ... [2023-11-21 19:43:58,217 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 19:43:58,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 19:43:58,219 INFO L158 Benchmark]: Toolchain (without parser) took 23530.89ms. Allocated memory was 140.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 94.4MB in the beginning and 674.1MB in the end (delta: -579.7MB). Peak memory consumption was 988.6MB. Max. memory is 16.1GB. [2023-11-21 19:43:58,219 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 140.5MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 19:43:58,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 752.99ms. Allocated memory is still 140.5MB. Free memory was 94.0MB in the beginning and 67.7MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-21 19:43:58,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.26ms. Allocated memory is still 140.5MB. Free memory was 67.7MB in the beginning and 64.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 19:43:58,221 INFO L158 Benchmark]: Boogie Preprocessor took 94.63ms. Allocated memory is still 140.5MB. Free memory was 64.6MB in the beginning and 62.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 19:43:58,222 INFO L158 Benchmark]: RCFGBuilder took 1260.86ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 62.0MB in the beginning and 89.0MB in the end (delta: -27.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2023-11-21 19:43:58,222 INFO L158 Benchmark]: TraceAbstraction took 21311.27ms. Allocated memory was 174.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 89.0MB in the beginning and 675.1MB in the end (delta: -586.2MB). Peak memory consumption was 946.8MB. Max. memory is 16.1GB. [2023-11-21 19:43:58,222 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 1.7GB. Free memory was 675.1MB in the beginning and 674.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 19:43:58,225 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.27ms. Allocated memory is still 140.5MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 752.99ms. Allocated memory is still 140.5MB. Free memory was 94.0MB in the beginning and 67.7MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.26ms. Allocated memory is still 140.5MB. Free memory was 67.7MB in the beginning and 64.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.63ms. Allocated memory is still 140.5MB. Free memory was 64.6MB in the beginning and 62.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1260.86ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 62.0MB in the beginning and 89.0MB in the end (delta: -27.0MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21311.27ms. Allocated memory was 174.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 89.0MB in the beginning and 675.1MB in the end (delta: -586.2MB). Peak memory consumption was 946.8MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 1.7GB. Free memory was 675.1MB in the beginning and 674.1MB in the end (delta: 1.0MB). 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~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - 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: 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 __assert_fail ("0", "safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 855]: 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: 857]: 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, 79 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1325 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1325 mSDsluCounter, 1384 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1045 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2334 IncrementalHoareTripleChecker+Invalid, 2514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 339 mSDtfsCounter, 2334 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6805occurred in iteration=0, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 4231 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 2463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-21 19:43:58,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5 --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 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 19:44:00,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:44:01,021 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-21 19:44:01,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:44:01,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:44:01,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:44:01,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:44:01,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:44:01,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:44:01,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:44:01,078 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-21 19:44:01,078 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-21 19:44:01,079 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-21 19:44:01,080 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-21 19:44:01,080 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-21 19:44:01,081 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-21 19:44:01,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:44:01,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:44:01,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:44:01,084 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:44:01,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:44:01,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:44:01,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:44:01,086 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 19:44:01,087 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 19:44:01,087 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 19:44:01,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:44:01,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 19:44:01,089 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 19:44:01,089 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 19:44:01,090 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:44:01,090 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:44:01,091 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:44:01,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:44:01,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:44:01,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 19:44:01,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:44:01,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:44:01,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:44:01,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:44:01,093 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-21 19:44:01,094 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 19:44:01,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:44:01,094 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-21 19:44:01,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 19:44:01,095 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_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/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_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5 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 -> 2b11be791089901ed5596869d293da40c27b85c1e89c21a55cf2181db7595687 [2023-11-21 19:44:01,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:44:01,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:44:01,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:44:01,569 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:44:01,570 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:44:01,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/../../sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 19:44:04,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:44:05,034 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:44:05,041 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/sv-benchmarks/c/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 19:44:05,065 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/data/656e82bb6/57a2d998db6f46729cc0932e3912b833/FLAGbde198588 [2023-11-21 19:44:05,083 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/data/656e82bb6/57a2d998db6f46729cc0932e3912b833 [2023-11-21 19:44:05,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:44:05,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:44:05,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:44:05,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:44:05,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:44:05,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19286c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05, skipping insertion in model container [2023-11-21 19:44:05,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,161 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:44:05,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:44:05,666 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:44:05,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:44:05,817 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:44:05,817 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:44:05,825 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:44:05,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05 WrapperNode [2023-11-21 19:44:05,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:44:05,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:44:05,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:44:05,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:44:05,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,892 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-21 19:44:05,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:44:05,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:44:05,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:44:05,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:44:05,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:44:05,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:44:05,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:44:05,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:44:05,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (1/1) ... [2023-11-21 19:44:05,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:44:06,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 19:44:06,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 19:44:06,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 19:44:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 19:44:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 19:44:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:44:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:44:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 19:44:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 19:44:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 19:44:06,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 19:44:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 19:44:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 19:44:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 19:44:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 19:44:06,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 19:44:06,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:44:06,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:44:06,060 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 19:44:06,269 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:44:06,271 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:44:06,834 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:44:07,241 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:44:07,241 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 19:44:07,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:44:07 BoogieIcfgContainer [2023-11-21 19:44:07,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:44:07,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:44:07,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:44:07,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:44:07,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:44:05" (1/3) ... [2023-11-21 19:44:07,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb5a908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:44:07, skipping insertion in model container [2023-11-21 19:44:07,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:05" (2/3) ... [2023-11-21 19:44:07,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb5a908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:44:07, skipping insertion in model container [2023-11-21 19:44:07,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:44:07" (3/3) ... [2023-11-21 19:44:07,258 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-21 19:44:07,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:44:07,281 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-21 19:44:07,281 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:44:07,361 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:44:07,402 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 54 transitions, 120 flow [2023-11-21 19:44:07,904 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 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-21 19:44:07,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 19:44:07,933 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;@785b9f1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:44:07,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-21 19:44:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 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-21 19:44:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 19:44:07,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:07,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 19:44:07,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:44:07,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 14835, now seen corresponding path program 1 times [2023-11-21 19:44:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:44:08,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863483455] [2023-11-21 19:44:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:08,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:08,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:44:08,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:44:08,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-21 19:44:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:08,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 19:44:08,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:08,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 19:44:08,233 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-21 19:44:08,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:44:08,234 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:44:08,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863483455] [2023-11-21 19:44:08,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863483455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:08,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:44:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698601593] [2023-11-21 19:44:08,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:08,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:44:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:44:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:44:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:44:08,293 INFO L87 Difference]: Start difference. First operand has 6805 states, 6792 states have (on average 3.6223498233215548) internal successors, (24603), 6804 states have internal predecessors, (24603), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 19:44:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:08,668 INFO L93 Difference]: Finished difference Result 6356 states and 22090 transitions. [2023-11-21 19:44:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:44:08,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 19:44:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:08,813 INFO L225 Difference]: With dead ends: 6356 [2023-11-21 19:44:08,813 INFO L226 Difference]: Without dead ends: 6356 [2023-11-21 19:44:08,815 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-21 19:44:08,819 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:08,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:44:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6356 states. [2023-11-21 19:44:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6356 to 6356. [2023-11-21 19:44:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6356 states, 6344 states have (on average 3.48203026481715) internal successors, (22090), 6355 states have internal predecessors, (22090), 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-21 19:44:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6356 states to 6356 states and 22090 transitions. [2023-11-21 19:44:09,416 INFO L78 Accepts]: Start accepts. Automaton has 6356 states and 22090 transitions. Word has length 2 [2023-11-21 19:44:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:09,416 INFO L495 AbstractCegarLoop]: Abstraction has 6356 states and 22090 transitions. [2023-11-21 19:44:09,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 19:44:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6356 states and 22090 transitions. [2023-11-21 19:44:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 19:44:09,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:09,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 19:44:09,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:09,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:09,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:44:09,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:09,620 INFO L85 PathProgramCache]: Analyzing trace with hash 14836, now seen corresponding path program 1 times [2023-11-21 19:44:09,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:44:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356613565] [2023-11-21 19:44:09,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:09,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:09,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:44:09,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:44:09,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-21 19:44:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:09,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 19:44:09,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:09,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:44:09,775 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-21 19:44:09,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:44:09,776 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:44:09,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356613565] [2023-11-21 19:44:09,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356613565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:09,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:09,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:44:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918548957] [2023-11-21 19:44:09,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:09,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:44:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:44:09,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:44:09,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:44:09,785 INFO L87 Difference]: Start difference. First operand 6356 states and 22090 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 19:44:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:10,068 INFO L93 Difference]: Finished difference Result 6355 states and 22089 transitions. [2023-11-21 19:44:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:44:10,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 19:44:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:10,137 INFO L225 Difference]: With dead ends: 6355 [2023-11-21 19:44:10,137 INFO L226 Difference]: Without dead ends: 6355 [2023-11-21 19:44:10,138 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-21 19:44:10,139 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:10,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 26 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:44:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2023-11-21 19:44:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 6355. [2023-11-21 19:44:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6355 states, 6344 states have (on average 3.4818726355611602) internal successors, (22089), 6354 states have internal predecessors, (22089), 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-21 19:44:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6355 states to 6355 states and 22089 transitions. [2023-11-21 19:44:10,478 INFO L78 Accepts]: Start accepts. Automaton has 6355 states and 22089 transitions. Word has length 2 [2023-11-21 19:44:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:10,478 INFO L495 AbstractCegarLoop]: Abstraction has 6355 states and 22089 transitions. [2023-11-21 19:44:10,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 19:44:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6355 states and 22089 transitions. [2023-11-21 19:44:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 19:44:10,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:10,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 19:44:10,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:10,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:10,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:44:10,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash 442400528, now seen corresponding path program 1 times [2023-11-21 19:44:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:44:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782537256] [2023-11-21 19:44:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:10,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:44:10,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:44:10,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-21 19:44:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:10,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 19:44:10,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:10,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 19:44:10,841 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-21 19:44:10,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:44:10,842 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:44:10,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782537256] [2023-11-21 19:44:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782537256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:44:10,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770865444] [2023-11-21 19:44:10,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:10,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:44:10,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:44:10,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:44:10,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:44:10,849 INFO L87 Difference]: Start difference. First operand 6355 states and 22089 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-21 19:44:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:11,191 INFO L93 Difference]: Finished difference Result 6347 states and 22074 transitions. [2023-11-21 19:44:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:44:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-21 19:44:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:11,262 INFO L225 Difference]: With dead ends: 6347 [2023-11-21 19:44:11,263 INFO L226 Difference]: Without dead ends: 6347 [2023-11-21 19:44:11,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-21 19:44:11,267 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:11,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:44:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2023-11-21 19:44:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 6347. [2023-11-21 19:44:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6347 states, 6337 states have (on average 3.4833517437273156) internal successors, (22074), 6346 states have internal predecessors, (22074), 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-21 19:44:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6347 states to 6347 states and 22074 transitions. [2023-11-21 19:44:11,703 INFO L78 Accepts]: Start accepts. Automaton has 6347 states and 22074 transitions. Word has length 5 [2023-11-21 19:44:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:11,704 INFO L495 AbstractCegarLoop]: Abstraction has 6347 states and 22074 transitions. [2023-11-21 19:44:11,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-21 19:44:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6347 states and 22074 transitions. [2023-11-21 19:44:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 19:44:11,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:11,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 19:44:11,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:11,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:11,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:44:11,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash 442400529, now seen corresponding path program 1 times [2023-11-21 19:44:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:44:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391034333] [2023-11-21 19:44:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:11,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:11,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:44:11,911 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:44:11,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-21 19:44:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:12,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 19:44:12,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:12,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:44:12,042 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-21 19:44:12,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:44:12,043 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:44:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391034333] [2023-11-21 19:44:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391034333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:44:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232683545] [2023-11-21 19:44:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:12,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:44:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:44:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:44:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:44:12,046 INFO L87 Difference]: Start difference. First operand 6347 states and 22074 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-21 19:44:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:12,221 INFO L93 Difference]: Finished difference Result 6339 states and 22059 transitions. [2023-11-21 19:44:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:44:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2023-11-21 19:44:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:12,258 INFO L225 Difference]: With dead ends: 6339 [2023-11-21 19:44:12,258 INFO L226 Difference]: Without dead ends: 6339 [2023-11-21 19:44:12,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-21 19:44:12,261 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:12,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:44:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6339 states. [2023-11-21 19:44:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6339 to 6339. [2023-11-21 19:44:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6330 states have (on average 3.4848341232227487) internal successors, (22059), 6338 states have internal predecessors, (22059), 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-21 19:44:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 22059 transitions. [2023-11-21 19:44:12,603 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 22059 transitions. Word has length 5 [2023-11-21 19:44:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:12,603 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 22059 transitions. [2023-11-21 19:44:12,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-21 19:44:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 22059 transitions. [2023-11-21 19:44:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 19:44:12,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:12,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:12,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:12,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:12,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:44:12,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1700046728, now seen corresponding path program 1 times [2023-11-21 19:44:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:44:12,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862107623] [2023-11-21 19:44:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:44:12,814 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:44:12,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-21 19:44:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:12,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 19:44:12,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:12,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:44:12,953 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-21 19:44:12,953 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:44:12,954 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:44:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862107623] [2023-11-21 19:44:12,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862107623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:12,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:12,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:44:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717072448] [2023-11-21 19:44:12,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:12,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:44:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:44:12,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:44:12,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:44:12,961 INFO L87 Difference]: Start difference. First operand 6339 states and 22059 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 19:44:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:13,235 INFO L93 Difference]: Finished difference Result 6275 states and 21883 transitions. [2023-11-21 19:44:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:44:13,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-11-21 19:44:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:13,287 INFO L225 Difference]: With dead ends: 6275 [2023-11-21 19:44:13,287 INFO L226 Difference]: Without dead ends: 6275 [2023-11-21 19:44:13,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-21 19:44:13,288 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:13,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 32 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:44:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2023-11-21 19:44:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 6275. [2023-11-21 19:44:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6275 states, 6268 states have (on average 3.4912252712188896) internal successors, (21883), 6274 states have internal predecessors, (21883), 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-21 19:44:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6275 states to 6275 states and 21883 transitions. [2023-11-21 19:44:13,601 INFO L78 Accepts]: Start accepts. Automaton has 6275 states and 21883 transitions. Word has length 8 [2023-11-21 19:44:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:13,602 INFO L495 AbstractCegarLoop]: Abstraction has 6275 states and 21883 transitions. [2023-11-21 19:44:13,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 19:44:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6275 states and 21883 transitions. [2023-11-21 19:44:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 19:44:13,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:13,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:13,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:13,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:13,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:44:13,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1700046729, now seen corresponding path program 1 times [2023-11-21 19:44:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:44:13,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248415221] [2023-11-21 19:44:13,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:44:13,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:44:13,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-21 19:44:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:13,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 19:44:13,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:13,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 19:44:13,929 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-21 19:44:13,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:44:13,929 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:44:13,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248415221] [2023-11-21 19:44:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248415221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:13,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:13,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:44:13,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916402003] [2023-11-21 19:44:13,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:13,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:44:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:44:13,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:44:13,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:44:13,932 INFO L87 Difference]: Start difference. First operand 6275 states and 21883 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 19:44:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:14,187 INFO L93 Difference]: Finished difference Result 6211 states and 21707 transitions. [2023-11-21 19:44:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:44:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-11-21 19:44:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:14,227 INFO L225 Difference]: With dead ends: 6211 [2023-11-21 19:44:14,227 INFO L226 Difference]: Without dead ends: 6211 [2023-11-21 19:44:14,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-21 19:44:14,228 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:14,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 31 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:44:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6211 states. [2023-11-21 19:44:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6211 to 6211. [2023-11-21 19:44:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6211 states, 6206 states have (on average 3.497744118594908) internal successors, (21707), 6210 states have internal predecessors, (21707), 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-21 19:44:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 21707 transitions. [2023-11-21 19:44:14,423 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 21707 transitions. Word has length 8 [2023-11-21 19:44:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:14,423 INFO L495 AbstractCegarLoop]: Abstraction has 6211 states and 21707 transitions. [2023-11-21 19:44:14,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-21 19:44:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 21707 transitions. [2023-11-21 19:44:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 19:44:14,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:14,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:14,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:14,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:14,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:44:14,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1700045572, now seen corresponding path program 1 times [2023-11-21 19:44:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:44:14,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477150739] [2023-11-21 19:44:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:14,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:14,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:44:14,631 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:44:14,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-21 19:44:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:14,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 19:44:14,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:14,752 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-21 19:44:14,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:44:14,752 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:44:14,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477150739] [2023-11-21 19:44:14,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477150739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:14,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:14,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:44:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621707384] [2023-11-21 19:44:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:14,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:44:14,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:44:14,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:44:14,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:44:14,755 INFO L87 Difference]: Start difference. First operand 6211 states and 21707 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-21 19:44:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:44:14,896 INFO L93 Difference]: Finished difference Result 5403 states and 18768 transitions. [2023-11-21 19:44:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:44:14,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-21 19:44:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:44:14,931 INFO L225 Difference]: With dead ends: 5403 [2023-11-21 19:44:14,931 INFO L226 Difference]: Without dead ends: 5291 [2023-11-21 19:44:14,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-21 19:44:14,933 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:44:14,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:44:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2023-11-21 19:44:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5291. [2023-11-21 19:44:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5289 states have (on average 3.4800529400642843) internal successors, (18406), 5290 states have internal predecessors, (18406), 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-21 19:44:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 18406 transitions. [2023-11-21 19:44:15,204 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 18406 transitions. Word has length 8 [2023-11-21 19:44:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:44:15,205 INFO L495 AbstractCegarLoop]: Abstraction has 5291 states and 18406 transitions. [2023-11-21 19:44:15,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-21 19:44:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 18406 transitions. [2023-11-21 19:44:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 19:44:15,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:44:15,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:44:15,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:15,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:15,423 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-21 19:44:15,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1450969925, now seen corresponding path program 1 times [2023-11-21 19:44:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:44:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106095920] [2023-11-21 19:44:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:15,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:44:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:44:15,426 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:44:15,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7c57d46-db02-4c2a-bfe0-76de125e040e/bin/utaipan-verify-QoSU8krkJ5/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-21 19:44:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:15,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 19:44:15,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:15,587 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-21 19:44:15,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:44:15,588 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:44:15,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106095920] [2023-11-21 19:44:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106095920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:15,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 19:44:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29518914] [2023-11-21 19:44:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 19:44:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:44:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 19:44:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 19:44:15,590 INFO L87 Difference]: Start difference. First operand 5291 states and 18406 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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)