./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009.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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 19:34:02,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:34:02,371 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-21 19:34:02,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:34:02,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:34:02,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:34:02,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:34:02,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:34:02,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:34:02,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:34:02,421 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-21 19:34:02,421 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-21 19:34:02,422 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-21 19:34:02,425 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-21 19:34:02,425 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-21 19:34:02,426 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-21 19:34:02,427 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-21 19:34:02,433 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-21 19:34:02,434 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-21 19:34:02,435 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-21 19:34:02,435 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-21 19:34:02,436 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-21 19:34:02,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:34:02,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:34:02,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:34:02,438 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:34:02,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:34:02,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:34:02,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:34:02,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 19:34:02,440 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 19:34:02,440 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 19:34:02,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:34:02,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 19:34:02,441 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:34:02,442 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:34:02,442 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:34:02,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:34:02,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 19:34:02,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:34:02,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:34:02,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:34:02,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:34:02,447 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-21 19:34:02,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:34:02,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:34:02,448 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-21 19:34:02,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 19:34:02,448 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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2023-11-21 19:34:02,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:34:02,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:34:02,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:34:02,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:34:02,774 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:34:02,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/../../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-21 19:34:06,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:34:06,306 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:34:06,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-21 19:34:06,335 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/data/26db8e9d8/1a7463ddfee5435299430e34394fb34a/FLAGf1f2f77a8 [2023-11-21 19:34:06,350 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/data/26db8e9d8/1a7463ddfee5435299430e34394fb34a [2023-11-21 19:34:06,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:34:06,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:34:06,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:34:06,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:34:06,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:34:06,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:34:06" (1/1) ... [2023-11-21 19:34:06,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bfef648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:06, skipping insertion in model container [2023-11-21 19:34:06,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:34:06" (1/1) ... [2023-11-21 19:34:06,427 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:34:06,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:34:06,904 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:34:06,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:34:07,030 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:34:07,030 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:34:07,039 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:34:07,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07 WrapperNode [2023-11-21 19:34:07,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:34:07,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:34:07,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:34:07,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:34:07,050 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:34:07" (1/1) ... [2023-11-21 19:34:07,068 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:34:07" (1/1) ... [2023-11-21 19:34:07,109 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2023-11-21 19:34:07,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:34:07,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:34:07,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:34:07,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:34:07,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:34:07,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:34:07,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:34:07,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:34:07,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (1/1) ... [2023-11-21 19:34:07,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:34:07,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 19:34:07,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:07,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:07,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 19:34:07,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 19:34:07,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 19:34:07,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:34:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:34:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 19:34:07,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 19:34:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 19:34:07,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 19:34:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 19:34:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 19:34:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:34:07,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:34:07,281 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:34:07,497 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:34:07,500 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:34:07,965 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:34:08,347 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:34:08,348 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 19:34:08,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:34:08 BoogieIcfgContainer [2023-11-21 19:34:08,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:34:08,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:34:08,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:34:08,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:34:08,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:34:06" (1/3) ... [2023-11-21 19:34:08,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba6f9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:34:08, skipping insertion in model container [2023-11-21 19:34:08,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:07" (2/3) ... [2023-11-21 19:34:08,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba6f9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:34:08, skipping insertion in model container [2023-11-21 19:34:08,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:34:08" (3/3) ... [2023-11-21 19:34:08,366 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2023-11-21 19:34:08,386 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:34:08,387 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-21 19:34:08,387 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:34:08,456 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:34:08,491 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 44 transitions, 96 flow [2023-11-21 19:34:08,648 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1211 states, 1202 states have (on average 2.820299500831947) internal successors, (3390), 1210 states have internal predecessors, (3390), 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:34:08,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 19:34:08,675 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;@580f756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:34:08,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-21 19:34:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 1211 states, 1202 states have (on average 2.820299500831947) internal successors, (3390), 1210 states have internal predecessors, (3390), 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:34:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 19:34:08,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:08,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 19:34:08,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:08,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash 12729, now seen corresponding path program 1 times [2023-11-21 19:34:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:08,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883498592] [2023-11-21 19:34:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:08,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:09,073 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:34:09,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:09,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883498592] [2023-11-21 19:34:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883498592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:09,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:09,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:34:09,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822012553] [2023-11-21 19:34:09,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:09,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:09,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:09,121 INFO L87 Difference]: Start difference. First operand has 1211 states, 1202 states have (on average 2.820299500831947) internal successors, (3390), 1210 states have internal predecessors, (3390), 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:34:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:09,240 INFO L93 Difference]: Finished difference Result 1129 states and 3002 transitions. [2023-11-21 19:34:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:09,243 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:34:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:09,266 INFO L225 Difference]: With dead ends: 1129 [2023-11-21 19:34:09,266 INFO L226 Difference]: Without dead ends: 1129 [2023-11-21 19:34:09,268 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:34:09,272 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:09,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 25 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2023-11-21 19:34:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2023-11-21 19:34:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1121 states have (on average 2.6779661016949152) internal successors, (3002), 1128 states have internal predecessors, (3002), 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:34:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 3002 transitions. [2023-11-21 19:34:09,396 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 3002 transitions. Word has length 2 [2023-11-21 19:34:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:09,397 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 3002 transitions. [2023-11-21 19:34:09,397 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:34:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 3002 transitions. [2023-11-21 19:34:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 19:34:09,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:09,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 19:34:09,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:34:09,401 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:09,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:09,402 INFO L85 PathProgramCache]: Analyzing trace with hash 12730, now seen corresponding path program 1 times [2023-11-21 19:34:09,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:09,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828494842] [2023-11-21 19:34:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:09,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:09,590 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:34:09,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828494842] [2023-11-21 19:34:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828494842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:34:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918989139] [2023-11-21 19:34:09,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:09,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:09,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:09,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:09,595 INFO L87 Difference]: Start difference. First operand 1129 states and 3002 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:34:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:09,675 INFO L93 Difference]: Finished difference Result 1128 states and 3001 transitions. [2023-11-21 19:34:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:09,675 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:34:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:09,685 INFO L225 Difference]: With dead ends: 1128 [2023-11-21 19:34:09,685 INFO L226 Difference]: Without dead ends: 1128 [2023-11-21 19:34:09,686 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:34:09,687 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:09,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 26 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2023-11-21 19:34:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2023-11-21 19:34:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1121 states have (on average 2.6770740410347904) internal successors, (3001), 1127 states have internal predecessors, (3001), 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:34:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3001 transitions. [2023-11-21 19:34:09,733 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3001 transitions. Word has length 2 [2023-11-21 19:34:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:09,734 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 3001 transitions. [2023-11-21 19:34:09,734 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:34:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3001 transitions. [2023-11-21 19:34:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 19:34:09,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:09,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 19:34:09,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 19:34:09,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:09,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash 379563466, now seen corresponding path program 1 times [2023-11-21 19:34:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:09,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10682118] [2023-11-21 19:34:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:09,831 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:34:09,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:09,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10682118] [2023-11-21 19:34:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10682118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:34:09,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102909405] [2023-11-21 19:34:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:09,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:09,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:09,835 INFO L87 Difference]: Start difference. First operand 1128 states and 3001 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:34:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:09,914 INFO L93 Difference]: Finished difference Result 1119 states and 2984 transitions. [2023-11-21 19:34:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:09,916 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:34:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:09,925 INFO L225 Difference]: With dead ends: 1119 [2023-11-21 19:34:09,925 INFO L226 Difference]: Without dead ends: 1119 [2023-11-21 19:34:09,926 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:34:09,927 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:09,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 31 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2023-11-21 19:34:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2023-11-21 19:34:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1113 states have (on average 2.6810422282120396) internal successors, (2984), 1118 states have internal predecessors, (2984), 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:34:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 2984 transitions. [2023-11-21 19:34:09,981 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 2984 transitions. Word has length 5 [2023-11-21 19:34:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:09,981 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 2984 transitions. [2023-11-21 19:34:09,982 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:34:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 2984 transitions. [2023-11-21 19:34:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 19:34:09,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:09,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 19:34:09,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 19:34:09,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:09,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash 379563467, now seen corresponding path program 1 times [2023-11-21 19:34:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919172216] [2023-11-21 19:34:09,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:10,117 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:34:10,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919172216] [2023-11-21 19:34:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919172216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:10,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:34:10,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929533151] [2023-11-21 19:34:10,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:10,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:10,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:10,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:10,122 INFO L87 Difference]: Start difference. First operand 1119 states and 2984 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:34:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:10,213 INFO L93 Difference]: Finished difference Result 1110 states and 2967 transitions. [2023-11-21 19:34:10,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:10,214 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:34:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:10,223 INFO L225 Difference]: With dead ends: 1110 [2023-11-21 19:34:10,223 INFO L226 Difference]: Without dead ends: 1110 [2023-11-21 19:34:10,224 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:34:10,233 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:10,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-11-21 19:34:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2023-11-21 19:34:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1105 states have (on average 2.685067873303167) internal successors, (2967), 1109 states have internal predecessors, (2967), 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:34:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 2967 transitions. [2023-11-21 19:34:10,284 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 2967 transitions. Word has length 5 [2023-11-21 19:34:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:10,285 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 2967 transitions. [2023-11-21 19:34:10,285 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:34:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 2967 transitions. [2023-11-21 19:34:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 19:34:10,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:10,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:10,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 19:34:10,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:10,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:10,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1073317634, now seen corresponding path program 1 times [2023-11-21 19:34:10,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185182908] [2023-11-21 19:34:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:10,529 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:34:10,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185182908] [2023-11-21 19:34:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185182908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:10,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:10,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:34:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311172087] [2023-11-21 19:34:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:10,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:10,533 INFO L87 Difference]: Start difference. First operand 1110 states and 2967 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:34:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:10,635 INFO L93 Difference]: Finished difference Result 984 states and 2612 transitions. [2023-11-21 19:34:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:10,636 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:34:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:10,645 INFO L225 Difference]: With dead ends: 984 [2023-11-21 19:34:10,645 INFO L226 Difference]: Without dead ends: 966 [2023-11-21 19:34:10,646 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:34:10,646 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:10,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-11-21 19:34:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2023-11-21 19:34:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 964 states have (on average 2.6649377593360994) internal successors, (2569), 965 states have internal predecessors, (2569), 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:34:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2569 transitions. [2023-11-21 19:34:10,688 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2569 transitions. Word has length 8 [2023-11-21 19:34:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:10,689 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 2569 transitions. [2023-11-21 19:34:10,689 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:34:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2569 transitions. [2023-11-21 19:34:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-21 19:34:10,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:10,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:10,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 19:34:10,702 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:10,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:10,702 INFO L85 PathProgramCache]: Analyzing trace with hash 818549937, now seen corresponding path program 1 times [2023-11-21 19:34:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572805281] [2023-11-21 19:34:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:11,104 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:34:11,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572805281] [2023-11-21 19:34:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572805281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:11,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:11,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:34:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997809119] [2023-11-21 19:34:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:11,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:34:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:34:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:34:11,124 INFO L87 Difference]: Start difference. First operand 966 states and 2569 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:34:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:11,341 INFO L93 Difference]: Finished difference Result 1424 states and 3739 transitions. [2023-11-21 19:34:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 19:34:11,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-21 19:34:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:11,352 INFO L225 Difference]: With dead ends: 1424 [2023-11-21 19:34:11,352 INFO L226 Difference]: Without dead ends: 1280 [2023-11-21 19:34:11,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 19:34:11,353 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:11,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 117 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:34:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2023-11-21 19:34:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1160. [2023-11-21 19:34:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1158 states have (on average 2.6424870466321244) internal successors, (3060), 1159 states have internal predecessors, (3060), 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:34:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 3060 transitions. [2023-11-21 19:34:11,401 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 3060 transitions. Word has length 15 [2023-11-21 19:34:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:11,402 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 3060 transitions. [2023-11-21 19:34:11,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:34:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 3060 transitions. [2023-11-21 19:34:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-21 19:34:11,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:11,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:11,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 19:34:11,405 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:11,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:11,406 INFO L85 PathProgramCache]: Analyzing trace with hash 818549763, now seen corresponding path program 1 times [2023-11-21 19:34:11,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:11,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020025787] [2023-11-21 19:34:11,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:11,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:11,609 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:34:11,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:11,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020025787] [2023-11-21 19:34:11,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020025787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:11,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:11,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:34:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96902912] [2023-11-21 19:34:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:11,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:34:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:11,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:34:11,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:34:11,612 INFO L87 Difference]: Start difference. First operand 1160 states and 3060 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:34:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:11,840 INFO L93 Difference]: Finished difference Result 1294 states and 3308 transitions. [2023-11-21 19:34:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 19:34:11,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-21 19:34:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:11,851 INFO L225 Difference]: With dead ends: 1294 [2023-11-21 19:34:11,851 INFO L226 Difference]: Without dead ends: 1150 [2023-11-21 19:34:11,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 19:34:11,853 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 79 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:11,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 105 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:34:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2023-11-21 19:34:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1075. [2023-11-21 19:34:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1073 states have (on average 2.5955265610438025) internal successors, (2785), 1074 states have internal predecessors, (2785), 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:34:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2785 transitions. [2023-11-21 19:34:11,899 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2785 transitions. Word has length 15 [2023-11-21 19:34:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:11,900 INFO L495 AbstractCegarLoop]: Abstraction has 1075 states and 2785 transitions. [2023-11-21 19:34:11,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:34:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2785 transitions. [2023-11-21 19:34:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-21 19:34:11,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:11,902 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:34:11,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 19:34:11,903 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:11,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1854226213, now seen corresponding path program 1 times [2023-11-21 19:34:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:11,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851431313] [2023-11-21 19:34:11,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:12,141 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:34:12,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851431313] [2023-11-21 19:34:12,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851431313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:12,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:12,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:34:12,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852077752] [2023-11-21 19:34:12,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:12,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:34:12,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:12,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:34:12,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:34:12,145 INFO L87 Difference]: Start difference. First operand 1075 states and 2785 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:34:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:12,345 INFO L93 Difference]: Finished difference Result 1065 states and 2722 transitions. [2023-11-21 19:34:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 19:34:12,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:34:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:12,354 INFO L225 Difference]: With dead ends: 1065 [2023-11-21 19:34:12,355 INFO L226 Difference]: Without dead ends: 975 [2023-11-21 19:34:12,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-21 19:34:12,356 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 50 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:12,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 101 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2023-11-21 19:34:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2023-11-21 19:34:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 973 states have (on average 2.5745118191161356) internal successors, (2505), 974 states have internal predecessors, (2505), 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:34:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 2505 transitions. [2023-11-21 19:34:12,415 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 2505 transitions. Word has length 18 [2023-11-21 19:34:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:12,416 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 2505 transitions. [2023-11-21 19:34:12,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:34:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 2505 transitions. [2023-11-21 19:34:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 19:34:12,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:12,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:12,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 19:34:12,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:12,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1654129779, now seen corresponding path program 1 times [2023-11-21 19:34:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:12,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338450957] [2023-11-21 19:34:12,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:12,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:12,664 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:34:12,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338450957] [2023-11-21 19:34:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338450957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:12,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:12,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:34:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283850802] [2023-11-21 19:34:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:12,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:34:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:12,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:34:12,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:34:12,668 INFO L87 Difference]: Start difference. First operand 975 states and 2505 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:34:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:12,839 INFO L93 Difference]: Finished difference Result 935 states and 2398 transitions. [2023-11-21 19:34:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 19:34:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-21 19:34:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:12,847 INFO L225 Difference]: With dead ends: 935 [2023-11-21 19:34:12,847 INFO L226 Difference]: Without dead ends: 775 [2023-11-21 19:34:12,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 19:34:12,849 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:12,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 92 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-11-21 19:34:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 515. [2023-11-21 19:34:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 2.5330739299610894) internal successors, (1302), 514 states have internal predecessors, (1302), 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:34:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1302 transitions. [2023-11-21 19:34:12,874 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1302 transitions. Word has length 19 [2023-11-21 19:34:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:12,875 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 1302 transitions. [2023-11-21 19:34:12,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:34:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1302 transitions. [2023-11-21 19:34:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-21 19:34:12,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:12,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:12,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 19:34:12,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:12,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash 982851619, now seen corresponding path program 1 times [2023-11-21 19:34:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180394150] [2023-11-21 19:34:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:13,089 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:34:13,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180394150] [2023-11-21 19:34:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180394150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:13,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:13,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 19:34:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431096689] [2023-11-21 19:34:13,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:13,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 19:34:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:13,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 19:34:13,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 19:34:13,094 INFO L87 Difference]: Start difference. First operand 515 states and 1302 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:34:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:13,217 INFO L93 Difference]: Finished difference Result 416 states and 958 transitions. [2023-11-21 19:34:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 19:34:13,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2023-11-21 19:34:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:13,221 INFO L225 Difference]: With dead ends: 416 [2023-11-21 19:34:13,221 INFO L226 Difference]: Without dead ends: 344 [2023-11-21 19:34:13,222 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:34:13,222 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:13,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 35 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-21 19:34:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2023-11-21 19:34:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.3002915451895043) internal successors, (789), 343 states have internal predecessors, (789), 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:34:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 789 transitions. [2023-11-21 19:34:13,236 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 789 transitions. Word has length 22 [2023-11-21 19:34:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:13,237 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 789 transitions. [2023-11-21 19:34:13,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:34:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 789 transitions. [2023-11-21 19:34:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-21 19:34:13,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:13,239 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] [2023-11-21 19:34:13,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 19:34:13,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:13,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1018608697, now seen corresponding path program 1 times [2023-11-21 19:34:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959453738] [2023-11-21 19:34:13,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:13,532 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:34:13,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959453738] [2023-11-21 19:34:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959453738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:13,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:34:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611603632] [2023-11-21 19:34:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:13,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:34:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:34:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:34:13,535 INFO L87 Difference]: Start difference. First operand 344 states and 789 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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:34:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:13,643 INFO L93 Difference]: Finished difference Result 236 states and 513 transitions. [2023-11-21 19:34:13,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 19:34:13,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2023-11-21 19:34:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:13,645 INFO L225 Difference]: With dead ends: 236 [2023-11-21 19:34:13,646 INFO L226 Difference]: Without dead ends: 206 [2023-11-21 19:34:13,646 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:34:13,647 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:13,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 26 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-21 19:34:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2023-11-21 19:34:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 2.1658536585365855) internal successors, (444), 205 states have internal predecessors, (444), 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:34:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 444 transitions. [2023-11-21 19:34:13,656 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 444 transitions. Word has length 25 [2023-11-21 19:34:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:13,657 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 444 transitions. [2023-11-21 19:34:13,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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:34:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 444 transitions. [2023-11-21 19:34:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 19:34:13,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:13,659 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:34:13,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 19:34:13,660 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:13,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -294389499, now seen corresponding path program 1 times [2023-11-21 19:34:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144915027] [2023-11-21 19:34:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:14,116 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:34:14,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144915027] [2023-11-21 19:34:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144915027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:14,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:14,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:34:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642582476] [2023-11-21 19:34:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:34:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:34:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:34:14,120 INFO L87 Difference]: Start difference. First operand 206 states and 444 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:34:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:14,277 INFO L93 Difference]: Finished difference Result 282 states and 602 transitions. [2023-11-21 19:34:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:34:14,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:34:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:14,280 INFO L225 Difference]: With dead ends: 282 [2023-11-21 19:34:14,281 INFO L226 Difference]: Without dead ends: 129 [2023-11-21 19:34:14,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:34:14,282 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:14,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 84 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-21 19:34:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-21 19:34:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.046875) internal successors, (262), 128 states have internal predecessors, (262), 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:34:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 262 transitions. [2023-11-21 19:34:14,291 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 262 transitions. Word has length 28 [2023-11-21 19:34:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:14,291 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 262 transitions. [2023-11-21 19:34:14,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:34:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 262 transitions. [2023-11-21 19:34:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 19:34:14,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:14,294 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:34:14,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 19:34:14,294 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:14,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1600645691, now seen corresponding path program 2 times [2023-11-21 19:34:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:14,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069915778] [2023-11-21 19:34:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:15,700 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:34:15,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-21 19:34:15,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069915778] [2023-11-21 19:34:15,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069915778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:15,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:15,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 19:34:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652252895] [2023-11-21 19:34:15,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:15,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 19:34:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-21 19:34:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 19:34:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:34:15,703 INFO L87 Difference]: Start difference. First operand 129 states and 262 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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:34:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:15,967 INFO L93 Difference]: Finished difference Result 173 states and 348 transitions. [2023-11-21 19:34:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:34:15,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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:34:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:15,969 INFO L225 Difference]: With dead ends: 173 [2023-11-21 19:34:15,969 INFO L226 Difference]: Without dead ends: 99 [2023-11-21 19:34:15,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-21 19:34:15,970 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:15,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 136 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:34:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-21 19:34:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-21 19:34:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.9081632653061225) internal successors, (187), 98 states have internal predecessors, (187), 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:34:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 187 transitions. [2023-11-21 19:34:15,974 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 187 transitions. Word has length 28 [2023-11-21 19:34:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:15,975 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 187 transitions. [2023-11-21 19:34:15,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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:34:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 187 transitions. [2023-11-21 19:34:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 19:34:15,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:15,976 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:34:15,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 19:34:15,976 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:15,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1776695867, now seen corresponding path program 3 times [2023-11-21 19:34:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-21 19:34:15,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422612582] [2023-11-21 19:34:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:34:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:34:16,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:34:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:34:16,088 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-21 19:34:16,089 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:34:16,090 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-21 19:34:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-21 19:34:16,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-21 19:34:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-21 19:34:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-21 19:34:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-21 19:34:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-21 19:34:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-21 19:34:16,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-21 19:34:16,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-21 19:34:16,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 19:34:16,097 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:16,103 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 19:34:16,103 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 19:34:16,149 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 19:34:16,151 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 19:34:16,161 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 19:34:16,162 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 19:34:16,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 07:34:16 BasicIcfg [2023-11-21 19:34:16,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 19:34:16,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 19:34:16,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 19:34:16,174 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 19:34:16,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:34:08" (3/4) ... [2023-11-21 19:34:16,176 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 19:34:16,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 19:34:16,178 INFO L158 Benchmark]: Toolchain (without parser) took 9821.66ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 116.8MB in the beginning and 74.5MB in the end (delta: 42.3MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2023-11-21 19:34:16,178 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 19:34:16,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.91ms. Allocated memory is still 155.2MB. Free memory was 116.8MB in the beginning and 92.9MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 19:34:16,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.45ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 89.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 19:34:16,180 INFO L158 Benchmark]: Boogie Preprocessor took 41.37ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 19:34:16,180 INFO L158 Benchmark]: RCFGBuilder took 1198.48ms. Allocated memory is still 155.2MB. Free memory was 87.8MB in the beginning and 79.9MB in the end (delta: 7.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-11-21 19:34:16,180 INFO L158 Benchmark]: TraceAbstraction took 7818.32ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 79.9MB in the beginning and 74.5MB in the end (delta: 5.5MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2023-11-21 19:34:16,181 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 230.7MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 19:34:16,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.91ms. Allocated memory is still 155.2MB. Free memory was 116.8MB in the beginning and 92.9MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.45ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 89.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.37ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1198.48ms. Allocated memory is still 155.2MB. Free memory was 87.8MB in the beginning and 79.9MB in the end (delta: 7.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7818.32ms. Allocated memory was 155.2MB in the beginning and 230.7MB in the end (delta: 75.5MB). Free memory was 79.9MB in the beginning and 74.5MB in the end (delta: 5.5MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 230.7MB. Free memory is still 74.5MB. 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: 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [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$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, t244={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=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_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L809] 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) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L849] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "mix009.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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 5 procedures, 63 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 841 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 558 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 955 IncrementalHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 283 mSDtfsCounter, 955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1211occurred in iteration=0, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 455 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 1180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:34:16,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 19:34:19,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:34:19,131 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-21 19:34:19,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:34:19,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:34:19,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:34:19,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:34:19,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:34:19,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:34:19,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:34:19,204 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-21 19:34:19,204 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-21 19:34:19,204 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-21 19:34:19,206 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-21 19:34:19,207 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-21 19:34:19,207 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-21 19:34:19,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:34:19,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:34:19,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:34:19,211 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:34:19,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:34:19,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:34:19,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:34:19,212 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 19:34:19,213 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 19:34:19,213 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 19:34:19,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:34:19,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 19:34:19,215 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 19:34:19,215 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 19:34:19,217 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:34:19,217 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:34:19,217 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:34:19,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:34:19,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:34:19,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 19:34:19,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:34:19,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:34:19,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:34:19,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:34:19,220 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-21 19:34:19,221 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 19:34:19,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:34:19,221 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-21 19:34:19,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 19:34:19,222 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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2023-11-21 19:34:19,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:34:19,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:34:19,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:34:19,704 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:34:19,707 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:34:19,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/../../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-21 19:34:22,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:34:23,273 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:34:23,277 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-21 19:34:23,306 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/data/91fd43bff/9a5b6dc5d1f4489ebeab1bd1f8450b7d/FLAGda0cddb5c [2023-11-21 19:34:23,322 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/data/91fd43bff/9a5b6dc5d1f4489ebeab1bd1f8450b7d [2023-11-21 19:34:23,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:34:23,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:34:23,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:34:23,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:34:23,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:34:23,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:34:23" (1/1) ... [2023-11-21 19:34:23,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508f19ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:23, skipping insertion in model container [2023-11-21 19:34:23,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:34:23" (1/1) ... [2023-11-21 19:34:23,416 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:34:23,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:34:23,943 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:34:24,012 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:34:24,061 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:34:24,061 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:34:24,070 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:34:24,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24 WrapperNode [2023-11-21 19:34:24,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:34:24,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:34:24,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:34:24,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:34:24,081 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:34:24" (1/1) ... [2023-11-21 19:34:24,111 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:34:24" (1/1) ... [2023-11-21 19:34:24,167 INFO L138 Inliner]: procedures = 178, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2023-11-21 19:34:24,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:34:24,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:34:24,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:34:24,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:34:24,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:34:24,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:34:24,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:34:24,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:34:24,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (1/1) ... [2023-11-21 19:34:24,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:34:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/z3 [2023-11-21 19:34:24,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:24,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 19:34:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 19:34:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:34:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:34:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 19:34:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 19:34:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 19:34:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 19:34:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 19:34:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 19:34:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 19:34:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:34:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:34:24,369 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:34:24,531 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:34:24,534 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:34:25,008 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:34:25,338 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:34:25,339 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 19:34:25,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:34:25 BoogieIcfgContainer [2023-11-21 19:34:25,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:34:25,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:34:25,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:34:25,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:34:25,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:34:23" (1/3) ... [2023-11-21 19:34:25,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc94870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:34:25, skipping insertion in model container [2023-11-21 19:34:25,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:34:24" (2/3) ... [2023-11-21 19:34:25,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc94870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:34:25, skipping insertion in model container [2023-11-21 19:34:25,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:34:25" (3/3) ... [2023-11-21 19:34:25,352 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2023-11-21 19:34:25,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:34:25,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-21 19:34:25,373 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:34:25,447 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:34:25,484 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 44 transitions, 96 flow [2023-11-21 19:34:25,623 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1211 states, 1202 states have (on average 2.820299500831947) internal successors, (3390), 1210 states have internal predecessors, (3390), 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:34:25,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 19:34:25,648 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;@15be5e02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:34:25,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-21 19:34:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 1211 states, 1202 states have (on average 2.820299500831947) internal successors, (3390), 1210 states have internal predecessors, (3390), 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:34:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 19:34:25,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:25,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 19:34:25,663 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:25,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 12793, now seen corresponding path program 1 times [2023-11-21 19:34:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:25,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390449422] [2023-11-21 19:34:25,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:25,683 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:34:25,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:25,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:25,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:25,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 19:34:25,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:25,899 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:34:25,913 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:34:25,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:25,914 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:25,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390449422] [2023-11-21 19:34:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390449422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:25,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:25,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:34:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960837825] [2023-11-21 19:34:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:25,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:25,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:25,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:25,968 INFO L87 Difference]: Start difference. First operand has 1211 states, 1202 states have (on average 2.820299500831947) internal successors, (3390), 1210 states have internal predecessors, (3390), 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:34:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:26,111 INFO L93 Difference]: Finished difference Result 1129 states and 3002 transitions. [2023-11-21 19:34:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:26,117 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:34:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:26,141 INFO L225 Difference]: With dead ends: 1129 [2023-11-21 19:34:26,141 INFO L226 Difference]: Without dead ends: 1129 [2023-11-21 19:34:26,143 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:34:26,147 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:26,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 25 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2023-11-21 19:34:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2023-11-21 19:34:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1121 states have (on average 2.6779661016949152) internal successors, (3002), 1128 states have internal predecessors, (3002), 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:34:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 3002 transitions. [2023-11-21 19:34:26,320 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 3002 transitions. Word has length 2 [2023-11-21 19:34:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:26,321 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 3002 transitions. [2023-11-21 19:34:26,321 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:34:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 3002 transitions. [2023-11-21 19:34:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 19:34:26,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:26,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 19:34:26,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:26,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:26,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:26,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash 12794, now seen corresponding path program 1 times [2023-11-21 19:34:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105848571] [2023-11-21 19:34:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:26,528 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:34:26,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:26,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:26,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:26,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 19:34:26,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:26,632 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:34:26,645 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:34:26,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:26,646 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105848571] [2023-11-21 19:34:26,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105848571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:26,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:26,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:34:26,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812814647] [2023-11-21 19:34:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:26,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:26,650 INFO L87 Difference]: Start difference. First operand 1129 states and 3002 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:34:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:26,762 INFO L93 Difference]: Finished difference Result 1128 states and 3001 transitions. [2023-11-21 19:34:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:26,762 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:34:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:26,772 INFO L225 Difference]: With dead ends: 1128 [2023-11-21 19:34:26,773 INFO L226 Difference]: Without dead ends: 1128 [2023-11-21 19:34:26,773 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:34:26,775 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:26,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 26 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2023-11-21 19:34:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2023-11-21 19:34:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1121 states have (on average 2.6770740410347904) internal successors, (3001), 1127 states have internal predecessors, (3001), 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:34:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3001 transitions. [2023-11-21 19:34:26,825 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3001 transitions. Word has length 2 [2023-11-21 19:34:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:26,825 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 3001 transitions. [2023-11-21 19:34:26,825 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:34:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3001 transitions. [2023-11-21 19:34:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 19:34:26,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:26,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 19:34:26,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:27,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:27,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:27,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 381472077, now seen corresponding path program 1 times [2023-11-21 19:34:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750886178] [2023-11-21 19:34:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:27,031 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:34:27,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:27,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:27,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:27,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 19:34:27,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:27,166 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:34:27,185 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:34:27,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:27,186 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750886178] [2023-11-21 19:34:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750886178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:27,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:27,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:34:27,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115764582] [2023-11-21 19:34:27,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:27,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:27,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:27,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:27,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:27,189 INFO L87 Difference]: Start difference. First operand 1128 states and 3001 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:34:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:27,295 INFO L93 Difference]: Finished difference Result 1119 states and 2984 transitions. [2023-11-21 19:34:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:27,295 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:34:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:27,305 INFO L225 Difference]: With dead ends: 1119 [2023-11-21 19:34:27,305 INFO L226 Difference]: Without dead ends: 1119 [2023-11-21 19:34:27,305 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:34:27,309 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:27,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2023-11-21 19:34:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2023-11-21 19:34:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1113 states have (on average 2.6810422282120396) internal successors, (2984), 1118 states have internal predecessors, (2984), 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:34:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 2984 transitions. [2023-11-21 19:34:27,357 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 2984 transitions. Word has length 5 [2023-11-21 19:34:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:27,358 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 2984 transitions. [2023-11-21 19:34:27,358 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:34:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 2984 transitions. [2023-11-21 19:34:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-21 19:34:27,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:27,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 19:34:27,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:27,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:27,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:27,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash 381472076, now seen corresponding path program 1 times [2023-11-21 19:34:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:27,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543747636] [2023-11-21 19:34:27,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:27,564 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:34:27,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:27,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:27,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:27,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 19:34:27,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:27,666 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:34:27,672 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:34:27,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:27,676 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:27,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543747636] [2023-11-21 19:34:27,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543747636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:27,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:27,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:34:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179983429] [2023-11-21 19:34:27,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:27,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:27,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:27,679 INFO L87 Difference]: Start difference. First operand 1119 states and 2984 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:34:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:27,768 INFO L93 Difference]: Finished difference Result 1110 states and 2967 transitions. [2023-11-21 19:34:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:27,769 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:34:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:27,778 INFO L225 Difference]: With dead ends: 1110 [2023-11-21 19:34:27,778 INFO L226 Difference]: Without dead ends: 1110 [2023-11-21 19:34:27,778 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:34:27,780 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:27,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-11-21 19:34:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2023-11-21 19:34:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1105 states have (on average 2.685067873303167) internal successors, (2967), 1109 states have internal predecessors, (2967), 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:34:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 2967 transitions. [2023-11-21 19:34:27,839 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 2967 transitions. Word has length 5 [2023-11-21 19:34:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:27,840 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 2967 transitions. [2023-11-21 19:34:27,840 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:34:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 2967 transitions. [2023-11-21 19:34:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 19:34:27,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:27,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:27,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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)] Ended with exit code 0 [2023-11-21 19:34:28,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:28,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:28,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash -48489986, now seen corresponding path program 1 times [2023-11-21 19:34:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525309223] [2023-11-21 19:34:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:28,045 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:34:28,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:28,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:28,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:28,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 19:34:28,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:28,188 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:34:28,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:28,189 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525309223] [2023-11-21 19:34:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525309223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 19:34:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712428008] [2023-11-21 19:34:28,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:28,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 19:34:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:28,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 19:34:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 19:34:28,191 INFO L87 Difference]: Start difference. First operand 1110 states and 2967 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:34:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:28,259 INFO L93 Difference]: Finished difference Result 984 states and 2612 transitions. [2023-11-21 19:34:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 19:34:28,259 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:34:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:28,267 INFO L225 Difference]: With dead ends: 984 [2023-11-21 19:34:28,268 INFO L226 Difference]: Without dead ends: 966 [2023-11-21 19:34:28,268 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:34:28,269 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:28,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-11-21 19:34:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2023-11-21 19:34:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 964 states have (on average 2.6649377593360994) internal successors, (2569), 965 states have internal predecessors, (2569), 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:34:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2569 transitions. [2023-11-21 19:34:28,308 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2569 transitions. Word has length 8 [2023-11-21 19:34:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:28,308 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 2569 transitions. [2023-11-21 19:34:28,308 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:34:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2569 transitions. [2023-11-21 19:34:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-21 19:34:28,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:28,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:28,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:28,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:28,515 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:28,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 211851845, now seen corresponding path program 1 times [2023-11-21 19:34:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:28,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815323859] [2023-11-21 19:34:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:28,516 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:34:28,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:28,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:28,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:28,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 19:34:28,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:28,655 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:34:28,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:28,655 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815323859] [2023-11-21 19:34:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815323859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 19:34:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510579301] [2023-11-21 19:34:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:28,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 19:34:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:28,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 19:34:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 19:34:28,659 INFO L87 Difference]: Start difference. First operand 966 states and 2569 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:34:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:28,771 INFO L93 Difference]: Finished difference Result 576 states and 1352 transitions. [2023-11-21 19:34:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 19:34:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-21 19:34:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:28,775 INFO L225 Difference]: With dead ends: 576 [2023-11-21 19:34:28,776 INFO L226 Difference]: Without dead ends: 504 [2023-11-21 19:34:28,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:34:28,777 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 41 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:34:28,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 41 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2023-11-21 19:34:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2023-11-21 19:34:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 502 states have (on average 2.356573705179283) internal successors, (1183), 503 states have internal predecessors, (1183), 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:34:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1183 transitions. [2023-11-21 19:34:28,797 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1183 transitions. Word has length 15 [2023-11-21 19:34:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:28,797 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 1183 transitions. [2023-11-21 19:34:28,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:34:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1183 transitions. [2023-11-21 19:34:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-21 19:34:28,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:28,804 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] [2023-11-21 19:34:28,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:29,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:29,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:29,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash -187107735, now seen corresponding path program 1 times [2023-11-21 19:34:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:29,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183659843] [2023-11-21 19:34:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:29,008 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:34:29,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:29,010 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:29,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:29,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 19:34:29,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:29,210 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:34:29,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:29,211 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:29,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183659843] [2023-11-21 19:34:29,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183659843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:29,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:29,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 19:34:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790389986] [2023-11-21 19:34:29,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:29,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:34:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:29,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:34:29,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:34:29,213 INFO L87 Difference]: Start difference. First operand 504 states and 1183 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:34:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:29,339 INFO L93 Difference]: Finished difference Result 248 states and 537 transitions. [2023-11-21 19:34:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 19:34:29,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2023-11-21 19:34:29,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:29,342 INFO L225 Difference]: With dead ends: 248 [2023-11-21 19:34:29,342 INFO L226 Difference]: Without dead ends: 218 [2023-11-21 19:34:29,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 19:34:29,343 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:29,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 54 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 19:34:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-21 19:34:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-11-21 19:34:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 2.1666666666666665) internal successors, (468), 217 states have internal predecessors, (468), 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:34:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 468 transitions. [2023-11-21 19:34:29,351 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 468 transitions. Word has length 21 [2023-11-21 19:34:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:29,352 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 468 transitions. [2023-11-21 19:34:29,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:34:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 468 transitions. [2023-11-21 19:34:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 19:34:29,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:29,354 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:34:29,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:29,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:29,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:29,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1342144791, now seen corresponding path program 1 times [2023-11-21 19:34:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380896908] [2023-11-21 19:34:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:29,560 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:34:29,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:29,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:29,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:29,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 19:34:29,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:29,776 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:34:29,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:29,776 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380896908] [2023-11-21 19:34:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380896908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:29,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:29,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:34:29,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43247326] [2023-11-21 19:34:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:29,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:34:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:29,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:34:29,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:34:29,778 INFO L87 Difference]: Start difference. First operand 218 states and 468 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:34:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:29,976 INFO L93 Difference]: Finished difference Result 306 states and 650 transitions. [2023-11-21 19:34:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:34:29,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:34:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:29,979 INFO L225 Difference]: With dead ends: 306 [2023-11-21 19:34:29,979 INFO L226 Difference]: Without dead ends: 306 [2023-11-21 19:34:29,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:34:29,980 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:29,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 90 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:34:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-11-21 19:34:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 294. [2023-11-21 19:34:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 292 states have (on average 2.1575342465753424) internal successors, (630), 293 states have internal predecessors, (630), 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:34:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 630 transitions. [2023-11-21 19:34:29,993 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 630 transitions. Word has length 28 [2023-11-21 19:34:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:29,993 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 630 transitions. [2023-11-21 19:34:29,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:34:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 630 transitions. [2023-11-21 19:34:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 19:34:29,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:29,995 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:34:30,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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)] Forceful destruction successful, exit code 0 [2023-11-21 19:34:30,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:30,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:30,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:30,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1342144965, now seen corresponding path program 1 times [2023-11-21 19:34:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061351399] [2023-11-21 19:34:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:34:30,201 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:34:30,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:30,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:30,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 (10)] Waiting until timeout for monitored process [2023-11-21 19:34:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:34:30,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 19:34:30,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:30,843 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:34:30,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:30,844 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:30,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061351399] [2023-11-21 19:34:30,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061351399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:30,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:30,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 19:34:30,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473969804] [2023-11-21 19:34:30,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:30,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 19:34:30,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:30,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 19:34:30,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:34:30,847 INFO L87 Difference]: Start difference. First operand 294 states and 630 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 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:34:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:31,060 INFO L93 Difference]: Finished difference Result 290 states and 622 transitions. [2023-11-21 19:34:31,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 19:34:31,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 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:34:31,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:31,062 INFO L225 Difference]: With dead ends: 290 [2023-11-21 19:34:31,062 INFO L226 Difference]: Without dead ends: 129 [2023-11-21 19:34:31,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 19:34:31,063 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:31,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:34:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-21 19:34:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-21 19:34:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.046875) internal successors, (262), 128 states have internal predecessors, (262), 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:34:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 262 transitions. [2023-11-21 19:34:31,067 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 262 transitions. Word has length 28 [2023-11-21 19:34:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:31,067 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 262 transitions. [2023-11-21 19:34:31,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 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:34:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 262 transitions. [2023-11-21 19:34:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 19:34:31,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:31,068 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:34:31,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 (10)] Forceful destruction successful, exit code 0 [2023-11-21 19:34:31,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:31,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:31,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:31,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1056265091, now seen corresponding path program 2 times [2023-11-21 19:34:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982455657] [2023-11-21 19:34:31,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:34:31,270 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:34:31,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:31,276 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:31,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 (11)] Waiting until timeout for monitored process [2023-11-21 19:34:31,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-21 19:34:31,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:34:31,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-21 19:34:31,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:34:32,334 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:34:32,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:34:32,334 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-21 19:34:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982455657] [2023-11-21 19:34:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982455657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:34:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:34:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 19:34:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114946956] [2023-11-21 19:34:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:34:32,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 19:34:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-21 19:34:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 19:34:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:34:32,337 INFO L87 Difference]: Start difference. First operand 129 states and 262 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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:34:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 19:34:32,614 INFO L93 Difference]: Finished difference Result 173 states and 348 transitions. [2023-11-21 19:34:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:34:32,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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:34:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 19:34:32,616 INFO L225 Difference]: With dead ends: 173 [2023-11-21 19:34:32,616 INFO L226 Difference]: Without dead ends: 99 [2023-11-21 19:34:32,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-21 19:34:32,617 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 19:34:32,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 146 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 19:34:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-21 19:34:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-21 19:34:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.9081632653061225) internal successors, (187), 98 states have internal predecessors, (187), 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:34:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 187 transitions. [2023-11-21 19:34:32,621 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 187 transitions. Word has length 28 [2023-11-21 19:34:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 19:34:32,622 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 187 transitions. [2023-11-21 19:34:32,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 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:34:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 187 transitions. [2023-11-21 19:34:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-21 19:34:32,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 19:34:32,623 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:34:32,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 (11)] Forceful destruction successful, exit code 0 [2023-11-21 19:34:32,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:32,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-21 19:34:32,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:34:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1232315267, now seen corresponding path program 3 times [2023-11-21 19:34:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-21 19:34:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214763884] [2023-11-21 19:34:32,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:34:32,828 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:34:32,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/bin/utaipan-verify-QoSU8krkJ5/mathsat [2023-11-21 19:34:32,829 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:32,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 (12)] Waiting until timeout for monitored process [2023-11-21 19:34:32,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-21 19:34:32,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-21 19:34:32,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:34:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:34:33,120 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-21 19:34:33,121 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:34:33,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-21 19:34:33,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-21 19:34:33,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-21 19:34:33,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-21 19:34:33,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-21 19:34:33,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-21 19:34:33,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-21 19:34:33,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-21 19:34:33,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-21 19:34:33,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-21 19:34:33,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 (12)] Forceful destruction successful, exit code 0 [2023-11-21 19:34:33,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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:34:33,333 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 19:34:33,338 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 19:34:33,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 19:34:33,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 19:34:33,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 19:34:33,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 19:34:33,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 19:34:33,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 07:34:33 BasicIcfg [2023-11-21 19:34:33,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 19:34:33,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 19:34:33,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 19:34:33,417 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 19:34:33,417 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:34:25" (3/4) ... [2023-11-21 19:34:33,419 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 19:34:33,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 19:34:33,421 INFO L158 Benchmark]: Toolchain (without parser) took 10091.63ms. Allocated memory was 77.6MB in the beginning and 148.9MB in the end (delta: 71.3MB). Free memory was 51.9MB in the beginning and 108.4MB in the end (delta: -56.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-11-21 19:34:33,421 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 77.6MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 19:34:33,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.01ms. Allocated memory was 77.6MB in the beginning and 102.8MB in the end (delta: 25.2MB). Free memory was 51.7MB in the beginning and 71.2MB in the end (delta: -19.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-11-21 19:34:33,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.84ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 68.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 19:34:33,422 INFO L158 Benchmark]: Boogie Preprocessor took 75.67ms. Allocated memory is still 102.8MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 19:34:33,422 INFO L158 Benchmark]: RCFGBuilder took 1092.59ms. Allocated memory is still 102.8MB. Free memory was 66.2MB in the beginning and 61.0MB in the end (delta: 5.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-11-21 19:34:33,423 INFO L158 Benchmark]: TraceAbstraction took 8072.18ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 60.5MB in the beginning and 109.5MB in the end (delta: -49.0MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2023-11-21 19:34:33,423 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 148.9MB. Free memory was 109.5MB in the beginning and 108.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 19:34:33,425 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.31ms. Allocated memory is still 77.6MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.01ms. Allocated memory was 77.6MB in the beginning and 102.8MB in the end (delta: 25.2MB). Free memory was 51.7MB in the beginning and 71.2MB in the end (delta: -19.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.84ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 68.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.67ms. Allocated memory is still 102.8MB. Free memory was 68.3MB in the beginning and 66.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1092.59ms. Allocated memory is still 102.8MB. Free memory was 66.2MB in the beginning and 61.0MB in the end (delta: 5.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8072.18ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 60.5MB in the beginning and 109.5MB in the end (delta: -49.0MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 148.9MB. Free memory was 109.5MB in the beginning and 108.4MB 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: 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [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$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={7: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={7:0}, t244={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L795] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L796] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L797] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L798] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L800] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=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_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L809] 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) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={7:0}, t244={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={7:0}, t244={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={7:0}, t244={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L849] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 __assert_fail ("0", "mix009.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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 5 procedures, 63 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 645 IncrementalHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 193 mSDtfsCounter, 645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1211occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 132 ConstructedInterpolants, 1 QuantifiedInterpolants, 1080 SizeOfPredicates, 11 NumberOfNonLiveVariables, 987 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:34:33,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c06d3bb7-f9bc-4d7e-afba-3c8b91310608/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample