./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E --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 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:42:31,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:42:31,536 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-13 23:42:31,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:42:31,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:42:31,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:42:31,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:42:31,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:42:31,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:42:31,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:42:31,586 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:42:31,588 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:42:31,588 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:42:31,588 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:42:31,588 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:42:31,588 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:42:31,588 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:42:31,589 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:42:31,589 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:42:31,589 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:42:31,589 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:42:31,589 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:42:31,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:42:31,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:42:31,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:42:31,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:42:31,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:42:31,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:42:31,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:42:31,592 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 23:42:31,592 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 23:42:31,592 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 23:42:31,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:42:31,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:42:31,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:42:31,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:42:31,594 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:42:31,594 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:42:31,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:42:31,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:42:31,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:42:31,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:42:31,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:42:31,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:42:31,595 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:42:31,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:42:31,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:42:31,595 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:42:31,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:42:31,595 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E 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 -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 [2024-11-13 23:42:31,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:42:31,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:42:31,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:42:31,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:42:31,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:42:31,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i Unable to find full path for "g++" [2024-11-13 23:42:34,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:42:34,706 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:42:34,707 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-13 23:42:34,740 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/data/14190bff0/15822d07b23b4e1fb322b9eae8b8fdc2/FLAG11a30a9d5 [2024-11-13 23:42:34,770 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/data/14190bff0/15822d07b23b4e1fb322b9eae8b8fdc2 [2024-11-13 23:42:34,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:42:34,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:42:34,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:42:34,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:42:34,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:42:34,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:42:34" (1/1) ... [2024-11-13 23:42:34,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507efc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:34, skipping insertion in model container [2024-11-13 23:42:34,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:42:34" (1/1) ... [2024-11-13 23:42:34,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:42:35,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:42:35,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:42:35,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:42:35,626 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:42:35,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35 WrapperNode [2024-11-13 23:42:35,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:42:35,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:42:35,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:42:35,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:42:35,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,692 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2024-11-13 23:42:35,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:42:35,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:42:35,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:42:35,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:42:35,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:42:35,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:42:35,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:42:35,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:42:35,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (1/1) ... [2024-11-13 23:42:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:42:35,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:42:35,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:42:35,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:42:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 23:42:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:42:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 23:42:35,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 23:42:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 23:42:35,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 23:42:35,846 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 23:42:35,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 23:42:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 23:42:35,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 23:42:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:42:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 23:42:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:42:35,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:42:35,849 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 23:42:36,063 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:42:36,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:42:36,629 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 23:42:36,630 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:42:37,025 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:42:37,026 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 23:42:37,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:42:37 BoogieIcfgContainer [2024-11-13 23:42:37,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:42:37,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:42:37,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:42:37,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:42:37,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:42:34" (1/3) ... [2024-11-13 23:42:37,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410508e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:42:37, skipping insertion in model container [2024-11-13 23:42:37,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:42:35" (2/3) ... [2024-11-13 23:42:37,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410508e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:42:37, skipping insertion in model container [2024-11-13 23:42:37,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:42:37" (3/3) ... [2024-11-13 23:42:37,040 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-13 23:42:37,060 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:42:37,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 23:42:37,063 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 23:42:37,176 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 23:42:37,229 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 55 transitions, 126 flow [2024-11-13 23:42:40,997 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 49849 states, 49844 states have (on average 4.519159778508948) internal successors, (225253), 49848 states have internal predecessors, (225253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:41,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:42:41,098 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5a145629, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:42:41,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 23:42:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 49849 states, 49844 states have (on average 4.519159778508948) internal successors, (225253), 49848 states have internal predecessors, (225253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:42:41,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:41,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:41,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:42:41,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash 463918960, now seen corresponding path program 1 times [2024-11-13 23:42:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252942261] [2024-11-13 23:42:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:41,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:42:42,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:42,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252942261] [2024-11-13 23:42:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252942261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:42:42,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:42:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:42:42,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26192081] [2024-11-13 23:42:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:42:42,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:42:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:42,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:42:42,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:42:42,585 INFO L87 Difference]: Start difference. First operand has 49849 states, 49844 states have (on average 4.519159778508948) internal successors, (225253), 49848 states have internal predecessors, (225253), 0 states have call successors, (0), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:44,845 INFO L93 Difference]: Finished difference Result 59796 states and 267638 transitions. [2024-11-13 23:42:44,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:42:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 23:42:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:45,797 INFO L225 Difference]: With dead ends: 59796 [2024-11-13 23:42:45,797 INFO L226 Difference]: Without dead ends: 40931 [2024-11-13 23:42:45,865 INFO L431 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 [2024-11-13 23:42:45,869 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:45,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:42:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40931 states. [2024-11-13 23:42:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40931 to 40931. [2024-11-13 23:42:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40931 states, 40929 states have (on average 4.364973490678981) internal successors, (178654), 40930 states have internal predecessors, (178654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40931 states to 40931 states and 178654 transitions. [2024-11-13 23:42:48,955 INFO L78 Accepts]: Start accepts. Automaton has 40931 states and 178654 transitions. Word has length 10 [2024-11-13 23:42:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:48,956 INFO L471 AbstractCegarLoop]: Abstraction has 40931 states and 178654 transitions. [2024-11-13 23:42:48,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 40931 states and 178654 transitions. [2024-11-13 23:42:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:42:48,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:48,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:48,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:42:48,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:42:48,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash 784436385, now seen corresponding path program 1 times [2024-11-13 23:42:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:48,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782546264] [2024-11-13 23:42:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:42:49,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:49,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782546264] [2024-11-13 23:42:49,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782546264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:42:49,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:42:49,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:42:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523982764] [2024-11-13 23:42:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:42:49,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:42:49,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:42:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:42:49,243 INFO L87 Difference]: Start difference. First operand 40931 states and 178654 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:50,523 INFO L93 Difference]: Finished difference Result 40931 states and 178654 transitions. [2024-11-13 23:42:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:42:50,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-13 23:42:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:50,872 INFO L225 Difference]: With dead ends: 40931 [2024-11-13 23:42:50,872 INFO L226 Difference]: Without dead ends: 31670 [2024-11-13 23:42:50,907 INFO L431 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 [2024-11-13 23:42:50,908 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:50,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:42:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31670 states. [2024-11-13 23:42:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31670 to 31670. [2024-11-13 23:42:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31670 states, 31669 states have (on average 4.336954119170167) internal successors, (137347), 31669 states have internal predecessors, (137347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31670 states to 31670 states and 137347 transitions. [2024-11-13 23:42:52,668 INFO L78 Accepts]: Start accepts. Automaton has 31670 states and 137347 transitions. Word has length 17 [2024-11-13 23:42:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:52,669 INFO L471 AbstractCegarLoop]: Abstraction has 31670 states and 137347 transitions. [2024-11-13 23:42:52,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 31670 states and 137347 transitions. [2024-11-13 23:42:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:42:52,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:52,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:52,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:42:52,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:42:52,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:52,684 INFO L85 PathProgramCache]: Analyzing trace with hash 784437702, now seen corresponding path program 1 times [2024-11-13 23:42:52,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:52,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310381398] [2024-11-13 23:42:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:42:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:42:54,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:42:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310381398] [2024-11-13 23:42:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310381398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:42:54,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:42:54,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:42:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6448055] [2024-11-13 23:42:54,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:42:54,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:42:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:42:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:42:54,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:42:54,220 INFO L87 Difference]: Start difference. First operand 31670 states and 137347 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:42:56,469 INFO L93 Difference]: Finished difference Result 72495 states and 311557 transitions. [2024-11-13 23:42:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:42:56,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-13 23:42:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:42:56,983 INFO L225 Difference]: With dead ends: 72495 [2024-11-13 23:42:56,983 INFO L226 Difference]: Without dead ends: 52020 [2024-11-13 23:42:57,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:42:57,042 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 177 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:42:57,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 222 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 23:42:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52020 states. [2024-11-13 23:42:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52020 to 32012. [2024-11-13 23:42:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32012 states, 32011 states have (on average 4.247758582987098) internal successors, (135975), 32011 states have internal predecessors, (135975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32012 states to 32012 states and 135975 transitions. [2024-11-13 23:42:59,261 INFO L78 Accepts]: Start accepts. Automaton has 32012 states and 135975 transitions. Word has length 17 [2024-11-13 23:42:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:42:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 32012 states and 135975 transitions. [2024-11-13 23:42:59,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:42:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 32012 states and 135975 transitions. [2024-11-13 23:42:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:42:59,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:42:59,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:42:59,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 23:42:59,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:42:59,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:42:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1313932347, now seen corresponding path program 1 times [2024-11-13 23:42:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:42:59,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607736967] [2024-11-13 23:42:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:42:59,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:42:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:00,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:00,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607736967] [2024-11-13 23:43:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607736967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:00,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:00,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:43:00,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091740117] [2024-11-13 23:43:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:00,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:43:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:43:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:43:00,217 INFO L87 Difference]: Start difference. First operand 32012 states and 135975 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) 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) [2024-11-13 23:43:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:02,100 INFO L93 Difference]: Finished difference Result 65679 states and 278277 transitions. [2024-11-13 23:43:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:43:02,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) 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 [2024-11-13 23:43:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:02,509 INFO L225 Difference]: With dead ends: 65679 [2024-11-13 23:43:02,509 INFO L226 Difference]: Without dead ends: 48470 [2024-11-13 23:43:02,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:43:02,574 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 159 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:02,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 262 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 23:43:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48470 states. [2024-11-13 23:43:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48470 to 30446. [2024-11-13 23:43:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30446 states, 30445 states have (on average 4.232517654787322) internal successors, (128859), 30445 states have internal predecessors, (128859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30446 states to 30446 states and 128859 transitions. [2024-11-13 23:43:05,189 INFO L78 Accepts]: Start accepts. Automaton has 30446 states and 128859 transitions. Word has length 19 [2024-11-13 23:43:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:05,190 INFO L471 AbstractCegarLoop]: Abstraction has 30446 states and 128859 transitions. [2024-11-13 23:43:05,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) 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) [2024-11-13 23:43:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 30446 states and 128859 transitions. [2024-11-13 23:43:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 23:43:05,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:05,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:05,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 23:43:05,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:05,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:05,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1111848936, now seen corresponding path program 1 times [2024-11-13 23:43:05,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:05,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435143495] [2024-11-13 23:43:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:05,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:05,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:05,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435143495] [2024-11-13 23:43:05,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435143495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:05,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:43:05,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403959295] [2024-11-13 23:43:05,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:05,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:43:05,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:05,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:43:05,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:43:05,611 INFO L87 Difference]: Start difference. First operand 30446 states and 128859 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:06,177 INFO L93 Difference]: Finished difference Result 37221 states and 156649 transitions. [2024-11-13 23:43:06,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:43:06,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-13 23:43:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:06,408 INFO L225 Difference]: With dead ends: 37221 [2024-11-13 23:43:06,409 INFO L226 Difference]: Without dead ends: 25026 [2024-11-13 23:43:06,441 INFO L431 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 [2024-11-13 23:43:06,441 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 110 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:06,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 174 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:43:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25026 states. [2024-11-13 23:43:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25026 to 24002. [2024-11-13 23:43:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24002 states, 24001 states have (on average 4.203616515978501) internal successors, (100891), 24001 states have internal predecessors, (100891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24002 states to 24002 states and 100891 transitions. [2024-11-13 23:43:07,698 INFO L78 Accepts]: Start accepts. Automaton has 24002 states and 100891 transitions. Word has length 20 [2024-11-13 23:43:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:07,698 INFO L471 AbstractCegarLoop]: Abstraction has 24002 states and 100891 transitions. [2024-11-13 23:43:07,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24002 states and 100891 transitions. [2024-11-13 23:43:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 23:43:07,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:07,738 INFO L215 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] [2024-11-13 23:43:07,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 23:43:07,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:07,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:07,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2124153819, now seen corresponding path program 1 times [2024-11-13 23:43:07,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:07,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111392963] [2024-11-13 23:43:07,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:08,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:08,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111392963] [2024-11-13 23:43:08,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111392963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:08,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:08,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:43:08,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360849559] [2024-11-13 23:43:08,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:08,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:43:08,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:08,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:43:08,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:43:08,172 INFO L87 Difference]: Start difference. First operand 24002 states and 100891 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:09,383 INFO L93 Difference]: Finished difference Result 39238 states and 163086 transitions. [2024-11-13 23:43:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:43:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-13 23:43:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:09,620 INFO L225 Difference]: With dead ends: 39238 [2024-11-13 23:43:09,620 INFO L226 Difference]: Without dead ends: 25910 [2024-11-13 23:43:09,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:43:09,644 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 90 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:09,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 204 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:43:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25910 states. [2024-11-13 23:43:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25910 to 22130. [2024-11-13 23:43:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22130 states, 22129 states have (on average 4.132541009534999) internal successors, (91449), 22129 states have internal predecessors, (91449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22130 states to 22130 states and 91449 transitions. [2024-11-13 23:43:10,399 INFO L78 Accepts]: Start accepts. Automaton has 22130 states and 91449 transitions. Word has length 24 [2024-11-13 23:43:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:10,400 INFO L471 AbstractCegarLoop]: Abstraction has 22130 states and 91449 transitions. [2024-11-13 23:43:10,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 22130 states and 91449 transitions. [2024-11-13 23:43:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:43:10,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:10,444 INFO L215 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] [2024-11-13 23:43:10,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 23:43:10,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:10,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1449325503, now seen corresponding path program 1 times [2024-11-13 23:43:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:10,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552140383] [2024-11-13 23:43:10,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:10,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:12,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:12,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552140383] [2024-11-13 23:43:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552140383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:43:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516706618] [2024-11-13 23:43:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:12,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:43:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:12,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:43:12,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:43:12,129 INFO L87 Difference]: Start difference. First operand 22130 states and 91449 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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) [2024-11-13 23:43:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:12,883 INFO L93 Difference]: Finished difference Result 30269 states and 124397 transitions. [2024-11-13 23:43:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:43:12,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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 [2024-11-13 23:43:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:13,110 INFO L225 Difference]: With dead ends: 30269 [2024-11-13 23:43:13,110 INFO L226 Difference]: Without dead ends: 24378 [2024-11-13 23:43:13,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:43:13,136 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 172 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:13,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 195 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:43:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24378 states. [2024-11-13 23:43:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24378 to 24038. [2024-11-13 23:43:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24038 states, 24037 states have (on average 4.107500936056912) internal successors, (98732), 24037 states have internal predecessors, (98732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24038 states to 24038 states and 98732 transitions. [2024-11-13 23:43:14,295 INFO L78 Accepts]: Start accepts. Automaton has 24038 states and 98732 transitions. Word has length 25 [2024-11-13 23:43:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:14,296 INFO L471 AbstractCegarLoop]: Abstraction has 24038 states and 98732 transitions. [2024-11-13 23:43:14,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 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) [2024-11-13 23:43:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24038 states and 98732 transitions. [2024-11-13 23:43:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 23:43:14,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:14,348 INFO L215 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] [2024-11-13 23:43:14,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 23:43:14,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:14,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1320463844, now seen corresponding path program 1 times [2024-11-13 23:43:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773276914] [2024-11-13 23:43:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:16,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:16,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773276914] [2024-11-13 23:43:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773276914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:16,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:43:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723970531] [2024-11-13 23:43:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:16,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 23:43:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 23:43:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:43:16,024 INFO L87 Difference]: Start difference. First operand 24038 states and 98732 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:16,874 INFO L93 Difference]: Finished difference Result 25973 states and 106100 transitions. [2024-11-13 23:43:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 23:43:16,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-13 23:43:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:17,085 INFO L225 Difference]: With dead ends: 25973 [2024-11-13 23:43:17,085 INFO L226 Difference]: Without dead ends: 22748 [2024-11-13 23:43:17,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:43:17,103 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 170 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:17,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 385 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:43:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22748 states. [2024-11-13 23:43:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22748 to 19700. [2024-11-13 23:43:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19700 states, 19699 states have (on average 4.107568912127519) internal successors, (80915), 19699 states have internal predecessors, (80915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19700 states to 19700 states and 80915 transitions. [2024-11-13 23:43:17,675 INFO L78 Accepts]: Start accepts. Automaton has 19700 states and 80915 transitions. Word has length 27 [2024-11-13 23:43:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:17,675 INFO L471 AbstractCegarLoop]: Abstraction has 19700 states and 80915 transitions. [2024-11-13 23:43:17,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 19700 states and 80915 transitions. [2024-11-13 23:43:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 23:43:17,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:17,929 INFO L215 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] [2024-11-13 23:43:17,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 23:43:17,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:17,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1621640480, now seen corresponding path program 1 times [2024-11-13 23:43:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:17,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955282047] [2024-11-13 23:43:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:17,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:18,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955282047] [2024-11-13 23:43:18,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955282047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:18,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:18,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:43:18,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773703268] [2024-11-13 23:43:18,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:18,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:43:18,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:18,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:43:18,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:43:18,171 INFO L87 Difference]: Start difference. First operand 19700 states and 80915 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:18,543 INFO L93 Difference]: Finished difference Result 29468 states and 118719 transitions. [2024-11-13 23:43:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:43:18,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-13 23:43:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:18,712 INFO L225 Difference]: With dead ends: 29468 [2024-11-13 23:43:18,712 INFO L226 Difference]: Without dead ends: 16742 [2024-11-13 23:43:18,741 INFO L431 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 [2024-11-13 23:43:18,742 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 78 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:18,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 55 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:43:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16742 states. [2024-11-13 23:43:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16742 to 16742. [2024-11-13 23:43:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16742 states, 16741 states have (on average 3.972940684546921) internal successors, (66511), 16741 states have internal predecessors, (66511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 66511 transitions. [2024-11-13 23:43:19,204 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 66511 transitions. Word has length 27 [2024-11-13 23:43:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:19,204 INFO L471 AbstractCegarLoop]: Abstraction has 16742 states and 66511 transitions. [2024-11-13 23:43:19,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 66511 transitions. [2024-11-13 23:43:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 23:43:19,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:19,232 INFO L215 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] [2024-11-13 23:43:19,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 23:43:19,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:19,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1924903282, now seen corresponding path program 1 times [2024-11-13 23:43:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:19,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954442712] [2024-11-13 23:43:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:19,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954442712] [2024-11-13 23:43:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954442712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:19,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:43:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878990803] [2024-11-13 23:43:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:19,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:43:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:19,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:43:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:43:19,686 INFO L87 Difference]: Start difference. First operand 16742 states and 66511 transitions. Second operand has 5 states, 5 states have (on average 5.6) 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) [2024-11-13 23:43:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:20,131 INFO L93 Difference]: Finished difference Result 21422 states and 83335 transitions. [2024-11-13 23:43:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:43:20,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) 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 [2024-11-13 23:43:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:20,289 INFO L225 Difference]: With dead ends: 21422 [2024-11-13 23:43:20,289 INFO L226 Difference]: Without dead ends: 11654 [2024-11-13 23:43:20,312 INFO L431 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 [2024-11-13 23:43:20,313 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 140 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:20,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 70 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:43:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11654 states. [2024-11-13 23:43:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11654 to 11654. [2024-11-13 23:43:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11654 states, 11653 states have (on average 3.795674933493521) internal successors, (44231), 11653 states have internal predecessors, (44231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 44231 transitions. [2024-11-13 23:43:20,786 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 44231 transitions. Word has length 28 [2024-11-13 23:43:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:20,786 INFO L471 AbstractCegarLoop]: Abstraction has 11654 states and 44231 transitions. [2024-11-13 23:43:20,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) 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) [2024-11-13 23:43:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 44231 transitions. [2024-11-13 23:43:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:43:20,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:20,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:20,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 23:43:20,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:20,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash -208446486, now seen corresponding path program 1 times [2024-11-13 23:43:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:20,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829706294] [2024-11-13 23:43:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:21,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829706294] [2024-11-13 23:43:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829706294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:21,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:21,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:43:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704285592] [2024-11-13 23:43:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:21,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:43:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:21,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:43:21,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:43:21,555 INFO L87 Difference]: Start difference. First operand 11654 states and 44231 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:22,277 INFO L93 Difference]: Finished difference Result 23090 states and 87119 transitions. [2024-11-13 23:43:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:43:22,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-13 23:43:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:22,622 INFO L225 Difference]: With dead ends: 23090 [2024-11-13 23:43:22,622 INFO L226 Difference]: Without dead ends: 11518 [2024-11-13 23:43:22,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:43:22,640 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 133 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:22,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 277 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:43:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11518 states. [2024-11-13 23:43:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11518 to 7734. [2024-11-13 23:43:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7734 states, 7733 states have (on average 3.7017974912711753) internal successors, (28626), 7733 states have internal predecessors, (28626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7734 states to 7734 states and 28626 transitions. [2024-11-13 23:43:22,971 INFO L78 Accepts]: Start accepts. Automaton has 7734 states and 28626 transitions. Word has length 31 [2024-11-13 23:43:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:22,971 INFO L471 AbstractCegarLoop]: Abstraction has 7734 states and 28626 transitions. [2024-11-13 23:43:22,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7734 states and 28626 transitions. [2024-11-13 23:43:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:43:22,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:22,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:22,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 23:43:22,981 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:22,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash -11484438, now seen corresponding path program 2 times [2024-11-13 23:43:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336893397] [2024-11-13 23:43:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:23,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:23,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336893397] [2024-11-13 23:43:23,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336893397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:23,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:23,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:43:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856055396] [2024-11-13 23:43:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:23,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:43:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:23,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:43:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:43:23,229 INFO L87 Difference]: Start difference. First operand 7734 states and 28626 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:23,576 INFO L93 Difference]: Finished difference Result 11862 states and 43526 transitions. [2024-11-13 23:43:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:43:23,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-13 23:43:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:23,698 INFO L225 Difference]: With dead ends: 11862 [2024-11-13 23:43:23,698 INFO L226 Difference]: Without dead ends: 8102 [2024-11-13 23:43:23,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:43:23,710 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 80 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:23,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 171 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:43:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8102 states. [2024-11-13 23:43:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8102 to 7350. [2024-11-13 23:43:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7350 states, 7349 states have (on average 3.648659681589332) internal successors, (26814), 7349 states have internal predecessors, (26814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 26814 transitions. [2024-11-13 23:43:24,018 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 26814 transitions. Word has length 31 [2024-11-13 23:43:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:24,019 INFO L471 AbstractCegarLoop]: Abstraction has 7350 states and 26814 transitions. [2024-11-13 23:43:24,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 26814 transitions. [2024-11-13 23:43:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:43:24,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:24,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:24,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 23:43:24,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:24,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1371405198, now seen corresponding path program 1 times [2024-11-13 23:43:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785468074] [2024-11-13 23:43:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:24,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:24,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785468074] [2024-11-13 23:43:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785468074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:24,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:24,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:43:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614221710] [2024-11-13 23:43:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:24,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:43:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:43:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:43:24,273 INFO L87 Difference]: Start difference. First operand 7350 states and 26814 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:24,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:24,568 INFO L93 Difference]: Finished difference Result 8366 states and 30106 transitions. [2024-11-13 23:43:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:43:24,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-13 23:43:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:24,639 INFO L225 Difference]: With dead ends: 8366 [2024-11-13 23:43:24,639 INFO L226 Difference]: Without dead ends: 4730 [2024-11-13 23:43:24,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:43:24,645 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 175 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:24,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 79 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:43:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2024-11-13 23:43:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 4730. [2024-11-13 23:43:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4730 states, 4729 states have (on average 3.5216747726792135) internal successors, (16654), 4729 states have internal predecessors, (16654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 16654 transitions. [2024-11-13 23:43:24,986 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 16654 transitions. Word has length 31 [2024-11-13 23:43:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:24,986 INFO L471 AbstractCegarLoop]: Abstraction has 4730 states and 16654 transitions. [2024-11-13 23:43:24,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 16654 transitions. [2024-11-13 23:43:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 23:43:24,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:24,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:24,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 23:43:24,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:24,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1409782188, now seen corresponding path program 1 times [2024-11-13 23:43:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:24,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039864684] [2024-11-13 23:43:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:25,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:25,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039864684] [2024-11-13 23:43:25,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039864684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:25,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:25,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:43:25,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365469623] [2024-11-13 23:43:25,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:25,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:43:25,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:25,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:43:25,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:43:25,287 INFO L87 Difference]: Start difference. First operand 4730 states and 16654 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:25,572 INFO L93 Difference]: Finished difference Result 4858 states and 17022 transitions. [2024-11-13 23:43:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:43:25,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-13 23:43:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:25,659 INFO L225 Difference]: With dead ends: 4858 [2024-11-13 23:43:25,659 INFO L226 Difference]: Without dead ends: 1422 [2024-11-13 23:43:25,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:43:25,670 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 220 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:25,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 62 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:43:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-11-13 23:43:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2024-11-13 23:43:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 3.451090781140042) internal successors, (4904), 1421 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 4904 transitions. [2024-11-13 23:43:25,787 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 4904 transitions. Word has length 34 [2024-11-13 23:43:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:25,787 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 4904 transitions. [2024-11-13 23:43:25,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 4904 transitions. [2024-11-13 23:43:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:43:25,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:25,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:25,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 23:43:25,792 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:25,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1035557781, now seen corresponding path program 1 times [2024-11-13 23:43:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:25,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029469353] [2024-11-13 23:43:25,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:25,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:27,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:43:27,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029469353] [2024-11-13 23:43:27,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029469353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:27,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:27,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 23:43:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2365518] [2024-11-13 23:43:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:27,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 23:43:27,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:43:27,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 23:43:27,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:43:27,609 INFO L87 Difference]: Start difference. First operand 1422 states and 4904 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:28,115 INFO L93 Difference]: Finished difference Result 1934 states and 6600 transitions. [2024-11-13 23:43:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 23:43:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-13 23:43:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:28,192 INFO L225 Difference]: With dead ends: 1934 [2024-11-13 23:43:28,193 INFO L226 Difference]: Without dead ends: 918 [2024-11-13 23:43:28,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-13 23:43:28,196 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 107 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:28,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 241 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:43:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-13 23:43:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2024-11-13 23:43:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 3.227917121046892) internal successors, (2960), 917 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 2960 transitions. [2024-11-13 23:43:28,293 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 2960 transitions. Word has length 39 [2024-11-13 23:43:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:28,293 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 2960 transitions. [2024-11-13 23:43:28,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2960 transitions. [2024-11-13 23:43:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:43:28,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:28,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:28,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 23:43:28,296 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:28,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:28,297 INFO L85 PathProgramCache]: Analyzing trace with hash -693914517, now seen corresponding path program 2 times [2024-11-13 23:43:28,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:43:28,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583239403] [2024-11-13 23:43:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:28,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:43:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:43:28,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:43:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:43:28,520 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:43:28,522 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:43:28,523 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-13 23:43:28,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-13 23:43:28,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-13 23:43:28,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-13 23:43:28,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-13 23:43:28,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-13 23:43:28,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-13 23:43:28,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-13 23:43:28,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 23:43:28,532 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:28,667 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 23:43:28,667 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:43:28,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:43:28 BasicIcfg [2024-11-13 23:43:28,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:43:28,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:43:28,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:43:28,672 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:43:28,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:42:37" (3/4) ... [2024-11-13 23:43:28,675 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:43:28,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:43:28,677 INFO L158 Benchmark]: Toolchain (without parser) took 53902.51ms. Allocated memory was 142.6MB in the beginning and 12.2GB in the end (delta: 12.0GB). Free memory was 117.9MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-11-13 23:43:28,677 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 142.6MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:43:28,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 850.76ms. Allocated memory is still 142.6MB. Free memory was 117.7MB in the beginning and 94.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 23:43:28,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.61ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:43:28,678 INFO L158 Benchmark]: Boogie Preprocessor took 42.41ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:43:28,678 INFO L158 Benchmark]: RCFGBuilder took 1290.33ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 107.0MB in the end (delta: -16.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-13 23:43:28,678 INFO L158 Benchmark]: TraceAbstraction took 51641.07ms. Allocated memory was 142.6MB in the beginning and 12.2GB in the end (delta: 12.0GB). Free memory was 105.9MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-11-13 23:43:28,679 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 12.2GB. Free memory was 9.8GB in the beginning and 9.8GB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:43:28,680 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.48ms. Allocated memory is still 142.6MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 850.76ms. Allocated memory is still 142.6MB. Free memory was 117.7MB in the beginning and 94.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.61ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 91.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.41ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1290.33ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 107.0MB in the end (delta: -16.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 51641.07ms. Allocated memory was 142.6MB in the beginning and 12.2GB in the end (delta: 12.0GB). Free memory was 105.9MB in the beginning and 9.8GB in the end (delta: -9.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 12.2GB. Free memory was 9.8GB in the beginning and 9.8GB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-1, t1254=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, t1256=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, t1256=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, t1256=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, t1256=2, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 845]: 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: 851]: 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: 849]: 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 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 51.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.9s, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1868 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1868 mSDsluCounter, 2467 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1791 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2062 IncrementalHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 676 mSDtfsCounter, 2062 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49849occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 50760 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 2846 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 23:43:28,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E --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 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:43:31,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:43:32,012 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-13 23:43:32,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:43:32,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:43:32,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:43:32,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:43:32,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:43:32,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:43:32,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:43:32,053 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:43:32,053 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:43:32,053 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:43:32,053 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:43:32,053 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:43:32,055 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:43:32,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:43:32,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:43:32,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:43:32,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:43:32,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:43:32,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:43:32,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:43:32,057 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 23:43:32,057 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 23:43:32,057 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 23:43:32,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:43:32,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:43:32,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:43:32,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:43:32,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:43:32,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:43:32,059 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:43:32,059 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:43:32,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:43:32,059 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:43:32,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E 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 -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 [2024-11-13 23:43:32,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:43:32,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:43:32,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:43:32,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:43:32,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:43:32,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i Unable to find full path for "g++" [2024-11-13 23:43:34,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:43:35,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:43:35,003 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-13 23:43:35,017 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/data/f0a6deec0/b01ab0dd12e641f4ad883ddb54ab508a/FLAG87495d53d [2024-11-13 23:43:35,032 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/data/f0a6deec0/b01ab0dd12e641f4ad883ddb54ab508a [2024-11-13 23:43:35,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:43:35,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:43:35,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:43:35,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:43:35,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:43:35,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab9f569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35, skipping insertion in model container [2024-11-13 23:43:35,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:43:35,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:43:35,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:43:35,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:43:35,824 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:43:35,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35 WrapperNode [2024-11-13 23:43:35,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:43:35,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:43:35,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:43:35,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:43:35,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,914 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2024-11-13 23:43:35,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:43:35,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:43:35,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:43:35,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:43:35,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:43:35,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:43:35,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:43:35,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:43:35,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (1/1) ... [2024-11-13 23:43:35,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:43:35,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:43:36,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:43:36,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:43:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 23:43:36,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:43:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:43:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 23:43:36,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 23:43:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 23:43:36,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 23:43:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 23:43:36,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 23:43:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-13 23:43:36,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-13 23:43:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 23:43:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:43:36,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:43:36,044 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 23:43:36,210 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:43:36,212 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:43:36,752 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 23:43:36,753 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:43:37,144 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:43:37,145 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 23:43:37,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:43:37 BoogieIcfgContainer [2024-11-13 23:43:37,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:43:37,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:43:37,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:43:37,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:43:37,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:43:35" (1/3) ... [2024-11-13 23:43:37,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6abc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:43:37, skipping insertion in model container [2024-11-13 23:43:37,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:43:35" (2/3) ... [2024-11-13 23:43:37,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6abc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:43:37, skipping insertion in model container [2024-11-13 23:43:37,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:43:37" (3/3) ... [2024-11-13 23:43:37,162 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-11-13 23:43:37,182 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:43:37,185 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 23:43:37,185 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 23:43:37,295 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 23:43:37,345 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 55 transitions, 126 flow [2024-11-13 23:43:41,190 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 49849 states, 49844 states have (on average 4.519159778508948) internal successors, (225253), 49848 states have internal predecessors, (225253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:41,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:43:41,246 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@585e834c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:43:41,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 23:43:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 49849 states, 49844 states have (on average 4.519159778508948) internal successors, (225253), 49848 states have internal predecessors, (225253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:43:41,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:41,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:41,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:41,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1775777968, now seen corresponding path program 1 times [2024-11-13 23:43:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:43:41,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330542121] [2024-11-13 23:43:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:41,441 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 [2024-11-13 23:43:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:43:41,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:43:41,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:41,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:43:41,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:41,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:43:41,688 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:43:41,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330542121] [2024-11-13 23:43:41,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330542121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:41,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:41,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:43:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73508721] [2024-11-13 23:43:41,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:43:41,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:43:41,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:43:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:43:41,830 INFO L87 Difference]: Start difference. First operand has 49849 states, 49844 states have (on average 4.519159778508948) internal successors, (225253), 49848 states have internal predecessors, (225253), 0 states have call successors, (0), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:44,186 INFO L93 Difference]: Finished difference Result 59796 states and 267638 transitions. [2024-11-13 23:43:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:43:44,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-13 23:43:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:45,556 INFO L225 Difference]: With dead ends: 59796 [2024-11-13 23:43:45,559 INFO L226 Difference]: Without dead ends: 40931 [2024-11-13 23:43:45,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:43:45,637 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:45,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:43:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40931 states. [2024-11-13 23:43:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40931 to 40931. [2024-11-13 23:43:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40931 states, 40929 states have (on average 4.364973490678981) internal successors, (178654), 40930 states have internal predecessors, (178654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40931 states to 40931 states and 178654 transitions. [2024-11-13 23:43:49,220 INFO L78 Accepts]: Start accepts. Automaton has 40931 states and 178654 transitions. Word has length 10 [2024-11-13 23:43:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:49,223 INFO L471 AbstractCegarLoop]: Abstraction has 40931 states and 178654 transitions. [2024-11-13 23:43:49,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 40931 states and 178654 transitions. [2024-11-13 23:43:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 23:43:49,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:49,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:49,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:43:49,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:49,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:49,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1863289507, now seen corresponding path program 1 times [2024-11-13 23:43:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:43:49,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748937593] [2024-11-13 23:43:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:49,455 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 [2024-11-13 23:43:49,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:43:49,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:43:49,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:49,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:43:49,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:49,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:43:49,686 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:43:49,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748937593] [2024-11-13 23:43:49,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748937593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:49,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:49,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:43:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107703930] [2024-11-13 23:43:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:49,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:43:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:43:49,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:43:49,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:43:49,690 INFO L87 Difference]: Start difference. First operand 40931 states and 178654 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:51,313 INFO L93 Difference]: Finished difference Result 65263 states and 279776 transitions. [2024-11-13 23:43:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:43:51,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-13 23:43:51,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:51,968 INFO L225 Difference]: With dead ends: 65263 [2024-11-13 23:43:51,968 INFO L226 Difference]: Without dead ends: 31306 [2024-11-13 23:43:52,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:43:52,053 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:52,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 61 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:43:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31306 states. [2024-11-13 23:43:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31306 to 31306. [2024-11-13 23:43:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31306 states, 31304 states have (on average 4.1697227191413235) internal successors, (130529), 31305 states have internal predecessors, (130529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31306 states to 31306 states and 130529 transitions. [2024-11-13 23:43:53,999 INFO L78 Accepts]: Start accepts. Automaton has 31306 states and 130529 transitions. Word has length 17 [2024-11-13 23:43:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:54,008 INFO L471 AbstractCegarLoop]: Abstraction has 31306 states and 130529 transitions. [2024-11-13 23:43:54,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 31306 states and 130529 transitions. [2024-11-13 23:43:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:43:54,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:54,058 INFO L215 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] [2024-11-13 23:43:54,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:43:54,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:54,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1147981544, now seen corresponding path program 1 times [2024-11-13 23:43:54,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:43:54,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282634767] [2024-11-13 23:43:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:54,267 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 [2024-11-13 23:43:54,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:43:54,273 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:43:54,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:54,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:43:54,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:54,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:43:54,531 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:43:54,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282634767] [2024-11-13 23:43:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282634767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:54,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:43:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669703078] [2024-11-13 23:43:54,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:54,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:43:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:43:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:43:54,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:43:54,534 INFO L87 Difference]: Start difference. First operand 31306 states and 130529 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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) [2024-11-13 23:43:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:55,645 INFO L93 Difference]: Finished difference Result 41338 states and 168601 transitions. [2024-11-13 23:43:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:43:55,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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 [2024-11-13 23:43:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:55,891 INFO L225 Difference]: With dead ends: 41338 [2024-11-13 23:43:55,891 INFO L226 Difference]: Without dead ends: 17006 [2024-11-13 23:43:55,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:43:55,951 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 138 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:55,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 95 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:43:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17006 states. [2024-11-13 23:43:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17006 to 17006. [2024-11-13 23:43:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17006 states, 17004 states have (on average 3.8919665960950365) internal successors, (66179), 17005 states have internal predecessors, (66179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17006 states to 17006 states and 66179 transitions. [2024-11-13 23:43:56,708 INFO L78 Accepts]: Start accepts. Automaton has 17006 states and 66179 transitions. Word has length 22 [2024-11-13 23:43:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:56,708 INFO L471 AbstractCegarLoop]: Abstraction has 17006 states and 66179 transitions. [2024-11-13 23:43:56,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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) [2024-11-13 23:43:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17006 states and 66179 transitions. [2024-11-13 23:43:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 23:43:56,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:56,768 INFO L215 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] [2024-11-13 23:43:56,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:56,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:56,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:56,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:56,971 INFO L85 PathProgramCache]: Analyzing trace with hash -32846177, now seen corresponding path program 1 times [2024-11-13 23:43:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:43:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246564443] [2024-11-13 23:43:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:56,975 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 [2024-11-13 23:43:56,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:43:56,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:43:56,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:57,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:43:57,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:57,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:43:57,276 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:43:57,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246564443] [2024-11-13 23:43:57,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246564443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:57,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:57,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:43:57,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791880761] [2024-11-13 23:43:57,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:57,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:43:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:43:57,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:43:57,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:43:57,278 INFO L87 Difference]: Start difference. First operand 17006 states and 66179 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:58,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:58,137 INFO L93 Difference]: Finished difference Result 19118 states and 73291 transitions. [2024-11-13 23:43:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:43:58,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-13 23:43:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:58,241 INFO L225 Difference]: With dead ends: 19118 [2024-11-13 23:43:58,242 INFO L226 Difference]: Without dead ends: 9086 [2024-11-13 23:43:58,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:43:58,265 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 190 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:58,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 174 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 23:43:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2024-11-13 23:43:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 9086. [2024-11-13 23:43:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9086 states, 9084 states have (on average 3.7977763099955966) internal successors, (34499), 9085 states have internal predecessors, (34499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 34499 transitions. [2024-11-13 23:43:58,587 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 34499 transitions. Word has length 27 [2024-11-13 23:43:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:43:58,587 INFO L471 AbstractCegarLoop]: Abstraction has 9086 states and 34499 transitions. [2024-11-13 23:43:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 34499 transitions. [2024-11-13 23:43:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 23:43:58,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:43:58,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:43:58,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:58,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:58,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:43:58,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:43:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash 183841964, now seen corresponding path program 1 times [2024-11-13 23:43:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:43:58,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482502153] [2024-11-13 23:43:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:43:58,813 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 [2024-11-13 23:43:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:43:58,816 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:43:58,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:43:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:43:58,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:43:58,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:43:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:43:59,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:43:59,066 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:43:59,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482502153] [2024-11-13 23:43:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482502153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:43:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:43:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:43:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466050953] [2024-11-13 23:43:59,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:43:59,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:43:59,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:43:59,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:43:59,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:43:59,068 INFO L87 Difference]: Start difference. First operand 9086 states and 34499 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:43:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:43:59,549 INFO L93 Difference]: Finished difference Result 9262 states and 35011 transitions. [2024-11-13 23:43:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:43:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-13 23:43:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:43:59,654 INFO L225 Difference]: With dead ends: 9262 [2024-11-13 23:43:59,654 INFO L226 Difference]: Without dead ends: 7150 [2024-11-13 23:43:59,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:43:59,664 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 216 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:43:59,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 264 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:43:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2024-11-13 23:44:00,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 7150. [2024-11-13 23:44:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7150 states, 7148 states have (on average 3.8784275321768327) internal successors, (27723), 7149 states have internal predecessors, (27723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 27723 transitions. [2024-11-13 23:44:00,236 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 27723 transitions. Word has length 32 [2024-11-13 23:44:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:44:00,237 INFO L471 AbstractCegarLoop]: Abstraction has 7150 states and 27723 transitions. [2024-11-13 23:44:00,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 27723 transitions. [2024-11-13 23:44:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:44:00,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:44:00,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:00,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:44:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:00,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:44:00,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:44:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1254899490, now seen corresponding path program 1 times [2024-11-13 23:44:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:44:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056657615] [2024-11-13 23:44:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:44:00,467 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 [2024-11-13 23:44:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:44:00,471 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:44:00,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:44:00,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 23:44:00,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:44:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:44:00,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:44:00,776 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:44:00,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056657615] [2024-11-13 23:44:00,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056657615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:44:00,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:44:00,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:44:00,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114566944] [2024-11-13 23:44:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:44:00,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:44:00,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:44:00,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:44:00,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:44:00,777 INFO L87 Difference]: Start difference. First operand 7150 states and 27723 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:44:00,896 INFO L93 Difference]: Finished difference Result 7150 states and 27723 transitions. [2024-11-13 23:44:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:44:00,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-13 23:44:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:44:00,991 INFO L225 Difference]: With dead ends: 7150 [2024-11-13 23:44:00,991 INFO L226 Difference]: Without dead ends: 7102 [2024-11-13 23:44:00,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:44:00,996 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:44:00,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:44:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7102 states. [2024-11-13 23:44:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7102 to 7102. [2024-11-13 23:44:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7102 states, 7101 states have (on average 3.8838191803971274) internal successors, (27579), 7101 states have internal predecessors, (27579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 27579 transitions. [2024-11-13 23:44:01,336 INFO L78 Accepts]: Start accepts. Automaton has 7102 states and 27579 transitions. Word has length 39 [2024-11-13 23:44:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:44:01,337 INFO L471 AbstractCegarLoop]: Abstraction has 7102 states and 27579 transitions. [2024-11-13 23:44:01,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 7102 states and 27579 transitions. [2024-11-13 23:44:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:44:01,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:44:01,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:01,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:44:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:01,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:44:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:44:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1254900807, now seen corresponding path program 1 times [2024-11-13 23:44:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:44:01,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132891818] [2024-11-13 23:44:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:44:01,568 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 [2024-11-13 23:44:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:44:01,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:44:01,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:44:01,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:44:01,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:44:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:44:02,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:44:02,021 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:44:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132891818] [2024-11-13 23:44:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132891818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:44:02,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:44:02,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:44:02,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338690161] [2024-11-13 23:44:02,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:44:02,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:44:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:44:02,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:44:02,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:44:02,023 INFO L87 Difference]: Start difference. First operand 7102 states and 27579 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:44:02,436 INFO L93 Difference]: Finished difference Result 9190 states and 35341 transitions. [2024-11-13 23:44:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:44:02,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-13 23:44:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:44:02,523 INFO L225 Difference]: With dead ends: 9190 [2024-11-13 23:44:02,524 INFO L226 Difference]: Without dead ends: 4082 [2024-11-13 23:44:02,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:44:02,536 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 52 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:44:02,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 189 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:44:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2024-11-13 23:44:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 4082. [2024-11-13 23:44:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 4081 states have (on average 3.7280078412153883) internal successors, (15214), 4081 states have internal predecessors, (15214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 15214 transitions. [2024-11-13 23:44:02,719 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 15214 transitions. Word has length 39 [2024-11-13 23:44:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:44:02,720 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 15214 transitions. [2024-11-13 23:44:02,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 15214 transitions. [2024-11-13 23:44:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:44:02,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:44:02,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:02,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:44:02,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:02,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:44:02,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:44:02,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2117271239, now seen corresponding path program 2 times [2024-11-13 23:44:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:44:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103920852] [2024-11-13 23:44:02,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 23:44:02,933 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 [2024-11-13 23:44:02,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:44:02,935 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:44:02,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:03,101 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 23:44:03,102 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:44:03,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:44:03,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:44:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:44:03,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:44:03,448 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:44:03,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103920852] [2024-11-13 23:44:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103920852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:44:03,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:44:03,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:44:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169116481] [2024-11-13 23:44:03,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:44:03,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:44:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:44:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:44:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:44:03,450 INFO L87 Difference]: Start difference. First operand 4082 states and 15214 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:44:03,676 INFO L93 Difference]: Finished difference Result 5330 states and 19694 transitions. [2024-11-13 23:44:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:44:03,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-13 23:44:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:44:03,743 INFO L225 Difference]: With dead ends: 5330 [2024-11-13 23:44:03,743 INFO L226 Difference]: Without dead ends: 2382 [2024-11-13 23:44:03,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:44:03,754 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:44:03,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 116 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:44:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2024-11-13 23:44:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2382. [2024-11-13 23:44:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 3.588408231835363) internal successors, (8544), 2381 states have internal predecessors, (8544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 8544 transitions. [2024-11-13 23:44:03,874 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 8544 transitions. Word has length 39 [2024-11-13 23:44:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:44:03,875 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 8544 transitions. [2024-11-13 23:44:03,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 8544 transitions. [2024-11-13 23:44:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:44:03,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:44:03,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:03,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:44:04,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:04,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:44:04,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:44:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash -320419735, now seen corresponding path program 3 times [2024-11-13 23:44:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:44:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120561622] [2024-11-13 23:44:04,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 23:44:04,091 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 [2024-11-13 23:44:04,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:44:04,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:44:04,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:04,257 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 23:44:04,258 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:44:04,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:44:04,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:44:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:44:04,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:44:04,335 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:44:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120561622] [2024-11-13 23:44:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120561622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:44:04,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:44:04,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:44:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095514578] [2024-11-13 23:44:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:44:04,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:44:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:44:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:44:04,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:44:04,337 INFO L87 Difference]: Start difference. First operand 2382 states and 8544 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:44:04,540 INFO L93 Difference]: Finished difference Result 3150 states and 11200 transitions. [2024-11-13 23:44:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:44:04,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-13 23:44:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:44:04,601 INFO L225 Difference]: With dead ends: 3150 [2024-11-13 23:44:04,602 INFO L226 Difference]: Without dead ends: 1422 [2024-11-13 23:44:04,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:44:04,606 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:44:04,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 107 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:44:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-11-13 23:44:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2024-11-13 23:44:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 3.451090781140042) internal successors, (4904), 1421 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 4904 transitions. [2024-11-13 23:44:04,700 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 4904 transitions. Word has length 39 [2024-11-13 23:44:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:44:04,701 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 4904 transitions. [2024-11-13 23:44:04,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 4904 transitions. [2024-11-13 23:44:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:44:04,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:44:04,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:04,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:44:04,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:04,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:44:04,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:44:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1606018989, now seen corresponding path program 4 times [2024-11-13 23:44:04,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:44:04,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249820885] [2024-11-13 23:44:04,909 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 23:44:04,910 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 [2024-11-13 23:44:04,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:44:04,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:44:04,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:05,052 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 23:44:05,052 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:44:05,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 23:44:05,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:44:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:44:05,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:44:05,306 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:44:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249820885] [2024-11-13 23:44:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249820885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:44:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:44:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:44:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486964215] [2024-11-13 23:44:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:44:05,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:44:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:44:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:44:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:44:05,308 INFO L87 Difference]: Start difference. First operand 1422 states and 4904 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:44:05,549 INFO L93 Difference]: Finished difference Result 2350 states and 7944 transitions. [2024-11-13 23:44:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:44:05,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-13 23:44:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:44:05,606 INFO L225 Difference]: With dead ends: 2350 [2024-11-13 23:44:05,606 INFO L226 Difference]: Without dead ends: 1334 [2024-11-13 23:44:05,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:44:05,609 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 72 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:44:05,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 203 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:44:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-13 23:44:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 918. [2024-11-13 23:44:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 3.227917121046892) internal successors, (2960), 917 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 2960 transitions. [2024-11-13 23:44:05,711 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 2960 transitions. Word has length 39 [2024-11-13 23:44:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:44:05,712 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 2960 transitions. [2024-11-13 23:44:05,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:44:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2960 transitions. [2024-11-13 23:44:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 23:44:05,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:44:05,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:05,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:44:05,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:05,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-13 23:44:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:44:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1515397037, now seen corresponding path program 5 times [2024-11-13 23:44:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:44:05,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695316961] [2024-11-13 23:44:05,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 23:44:05,920 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 [2024-11-13 23:44:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:44:05,921 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:44:05,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:06,050 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 23:44:06,050 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 23:44:06,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:44:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:44:06,262 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-13 23:44:06,263 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:44:06,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-13 23:44:06,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-13 23:44:06,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-13 23:44:06,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-13 23:44:06,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-13 23:44:06,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-13 23:44:06,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-13 23:44:06,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-13 23:44:06,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:44:06,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:44:06,472 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-13 23:44:06,596 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 23:44:06,596 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:44:06,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:44:06 BasicIcfg [2024-11-13 23:44:06,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:44:06,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:44:06,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:44:06,604 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:44:06,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:43:37" (3/4) ... [2024-11-13 23:44:06,607 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:44:06,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:44:06,610 INFO L158 Benchmark]: Toolchain (without parser) took 31574.06ms. Allocated memory was 83.9MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 59.0MB in the beginning and 7.9GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 23:44:06,611 INFO L158 Benchmark]: CDTParser took 3.76ms. Allocated memory is still 83.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:44:06,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 789.48ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 35.4MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:44:06,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.75ms. Allocated memory is still 83.9MB. Free memory was 35.4MB in the beginning and 32.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:44:06,612 INFO L158 Benchmark]: Boogie Preprocessor took 56.25ms. Allocated memory is still 83.9MB. Free memory was 32.8MB in the beginning and 31.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:44:06,613 INFO L158 Benchmark]: RCFGBuilder took 1174.40ms. Allocated memory is still 83.9MB. Free memory was 30.9MB in the beginning and 31.5MB in the end (delta: -625.5kB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-13 23:44:06,613 INFO L158 Benchmark]: TraceAbstraction took 29453.96ms. Allocated memory was 83.9MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 31.0MB in the beginning and 7.9GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 23:44:06,613 INFO L158 Benchmark]: Witness Printer took 5.50ms. Allocated memory is still 9.3GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 72.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:44:06,615 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.76ms. Allocated memory is still 83.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 789.48ms. Allocated memory is still 83.9MB. Free memory was 59.0MB in the beginning and 35.4MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.75ms. Allocated memory is still 83.9MB. Free memory was 35.4MB in the beginning and 32.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.25ms. Allocated memory is still 83.9MB. Free memory was 32.8MB in the beginning and 31.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1174.40ms. Allocated memory is still 83.9MB. Free memory was 30.9MB in the beginning and 31.5MB in the end (delta: -625.5kB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 29453.96ms. Allocated memory was 83.9MB in the beginning and 9.3GB in the end (delta: 9.2GB). Free memory was 31.0MB in the beginning and 7.9GB in the end (delta: -7.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 5.50ms. Allocated memory is still 9.3GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 72.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=0, t1254=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=0, t1254=1, t1255=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=0, t1254=1, t1255=2, t1256=3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=0, t1254=1, t1255=2, t1256=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=0, t1254=1, t1255=2, t1256=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=0, t1254=1, t1255=2, t1256=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 845]: 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: 851]: 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 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 29.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.4s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 836 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 836 mSDsluCounter, 1279 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 917 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1329 IncrementalHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 362 mSDtfsCounter, 1329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49849occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 416 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 342 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 782 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1248 ConjunctsInSsa, 56 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 [2024-11-13 23:44:06,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45b5785f-3afd-4369-a756-75d2b5db317d/bin/utaipan-verify-sOmjnqqW8E/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample