./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 4fc63b2a
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3fc7a688cbe32836e1b8ce30abe37b248e61f96ae5014519dab91b2515bcd4ed
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-4fc63b2
[2024-11-02 12:30:11,005 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-02 12:30:11,103 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf
[2024-11-02 12:30:11,111 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-02 12:30:11,112 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-02 12:30:11,151 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-02 12:30:11,153 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-02 12:30:11,154 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-02 12:30:11,155 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-02 12:30:11,155 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-02 12:30:11,156 INFO  L153        SettingsManager]:  * User list type=DISABLED
[2024-11-02 12:30:11,156 INFO  L151        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2024-11-02 12:30:11,157 INFO  L153        SettingsManager]:  * Explicit value domain=true
[2024-11-02 12:30:11,160 INFO  L153        SettingsManager]:  * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2024-11-02 12:30:11,160 INFO  L153        SettingsManager]:  * Octagon Domain=false
[2024-11-02 12:30:11,161 INFO  L153        SettingsManager]:  * Abstract domain=CompoundDomain
[2024-11-02 12:30:11,161 INFO  L153        SettingsManager]:  * Check feasibility of abstract posts with an SMT solver=true
[2024-11-02 12:30:11,161 INFO  L153        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2024-11-02 12:30:11,162 INFO  L153        SettingsManager]:  * Interval Domain=false
[2024-11-02 12:30:11,166 INFO  L151        SettingsManager]: Preferences of Sifa differ from their defaults:
[2024-11-02 12:30:11,166 INFO  L153        SettingsManager]:  * Call Summarizer=TopInputCallSummarizer
[2024-11-02 12:30:11,167 INFO  L153        SettingsManager]:  * Simplification Technique=POLY_PAC
[2024-11-02 12:30:11,168 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-02 12:30:11,168 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-02 12:30:11,168 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-02 12:30:11,169 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-02 12:30:11,169 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-02 12:30:11,170 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-02 12:30:11,170 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-02 12:30:11,170 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-02 12:30:11,171 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-02 12:30:11,171 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-02 12:30:11,171 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-02 12:30:11,172 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-02 12:30:11,172 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-02 12:30:11,172 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-02 12:30:11,173 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-02 12:30:11,173 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-02 12:30:11,173 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-11-02 12:30:11,174 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-02 12:30:11,175 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-02 12:30:11,176 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-02 12:30:11,176 INFO  L153        SettingsManager]:  * Trace refinement strategy=SIFA_TAIPAN
[2024-11-02 12:30:11,176 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-02 12:30:11,178 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-02 12:30:11,178 INFO  L153        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2024-11-02 12:30:11,178 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-02 12:30:11,179 INFO  L153        SettingsManager]:  * Abstract interpretation Mode=USE_PREDICATES
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2
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 ! call(reach_error())) )


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 -> 3fc7a688cbe32836e1b8ce30abe37b248e61f96ae5014519dab91b2515bcd4ed
[2024-11-02 12:30:11,549 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-02 12:30:11,584 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-02 12:30:11,589 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-02 12:30:11,592 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-02 12:30:11,592 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-02 12:30:11,594 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i
Unable to find full path for "g++"
[2024-11-02 12:30:13,720 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-02 12:30:14,040 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-02 12:30:14,041 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i
[2024-11-02 12:30:14,060 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/data/ff02a58eb/fc3d2b6bcdae4a0eb4f56e8ff64b53ca/FLAG8c08b95b9
[2024-11-02 12:30:14,083 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/data/ff02a58eb/fc3d2b6bcdae4a0eb4f56e8ff64b53ca
[2024-11-02 12:30:14,087 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-02 12:30:14,090 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-02 12:30:14,092 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-02 12:30:14,092 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-02 12:30:14,100 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-02 12:30:14,103 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,104 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a0e4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14, skipping insertion in model container
[2024-11-02 12:30:14,104 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,165 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-02 12:30:14,384 WARN  L251   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i[1001,1014]
[2024-11-02 12:30:14,684 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-02 12:30:14,701 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-02 12:30:14,716 WARN  L251   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/sv-benchmarks/c/pthread-wmm/mix016_power.opt_rmo.opt.i[1001,1014]
[2024-11-02 12:30:14,792 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-02 12:30:14,843 INFO  L204         MainTranslator]: Completed translation
[2024-11-02 12:30:14,843 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14 WrapperNode
[2024-11-02 12:30:14,844 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-02 12:30:14,845 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-02 12:30:14,845 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-02 12:30:14,846 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-02 12:30:14,854 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,883 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,930 INFO  L138                Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117
[2024-11-02 12:30:14,934 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-02 12:30:14,935 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-02 12:30:14,936 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-02 12:30:14,936 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-02 12:30:14,957 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,957 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,964 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,964 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,979 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,984 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,989 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,993 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:14,999 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-02 12:30:15,003 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-02 12:30:15,004 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-02 12:30:15,005 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-02 12:30:15,010 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (1/1) ...
[2024-11-02 12:30:15,032 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-11-02 12:30:15,045 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/z3
[2024-11-02 12:30:15,066 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-11-02 12:30:15,070 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-11-02 12:30:15,108 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-02 12:30:15,108 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-02 12:30:15,108 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-02 12:30:15,110 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-02 12:30:15,110 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-02 12:30:15,111 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-02 12:30:15,111 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-02 12:30:15,111 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-02 12:30:15,111 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-11-02 12:30:15,111 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-02 12:30:15,112 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-02 12:30:15,112 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-02 12:30:15,114 WARN  L207             CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-02 12:30:15,349 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-02 12:30:15,352 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-02 12:30:15,758 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-02 12:30:15,758 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-02 12:30:16,021 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-02 12:30:16,024 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-02 12:30:16,024 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:16 BoogieIcfgContainer
[2024-11-02 12:30:16,024 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-02 12:30:16,027 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-02 12:30:16,035 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-02 12:30:16,039 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-02 12:30:16,039 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:30:14" (1/3) ...
[2024-11-02 12:30:16,040 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e072a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:30:16, skipping insertion in model container
[2024-11-02 12:30:16,041 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:14" (2/3) ...
[2024-11-02 12:30:16,041 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e072a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:30:16, skipping insertion in model container
[2024-11-02 12:30:16,041 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:16" (3/3) ...
[2024-11-02 12:30:16,042 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i
[2024-11-02 12:30:16,065 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-02 12:30:16,065 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-11-02 12:30:16,065 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-02 12:30:16,144 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-02 12:30:16,216 INFO  L113   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 40 transitions, 92 flow
[2024-11-02 12:30:16,571 INFO  L135   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 4496 states, 4493 states have (on average 3.5032272423770308) internal successors, (15740), 4495 states have internal predecessors, (15740), 0 states have call successors, (0), 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-02 12:30:16,604 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-02 12:30:16,610 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=LoopHeads, 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;@796df5fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-02 12:30:16,611 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-11-02 12:30:16,630 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 4496 states, 4493 states have (on average 3.5032272423770308) internal successors, (15740), 4495 states have internal predecessors, (15740), 0 states have call successors, (0), 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-02 12:30:16,635 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-02 12:30:16,636 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 12:30:16,636 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-02 12:30:16,637 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-02 12:30:16,641 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 12:30:16,641 INFO  L85        PathProgramCache]: Analyzing trace with hash 1848464760, now seen corresponding path program 1 times
[2024-11-02 12:30:16,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2024-11-02 12:30:16,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724875261]
[2024-11-02 12:30:16,652 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 12:30:16,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 12:30:16,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 12:30:17,243 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-02 12:30:17,244 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2024-11-02 12:30:17,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724875261]
[2024-11-02 12:30:17,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724875261] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-02 12:30:17,245 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-02 12:30:17,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-02 12:30:17,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022128929]
[2024-11-02 12:30:17,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-02 12:30:17,250 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-02 12:30:17,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2024-11-02 12:30:17,272 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-02 12:30:17,273 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-02 12:30:17,288 INFO  L87              Difference]: Start difference. First operand  has 4496 states, 4493 states have (on average 3.5032272423770308) internal successors, (15740), 4495 states have internal predecessors, (15740), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-02 12:30:17,547 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 12:30:17,547 INFO  L93              Difference]: Finished difference Result 4720 states and 16464 transitions.
[2024-11-02 12:30:17,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-02 12:30:17,551 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6
[2024-11-02 12:30:17,552 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 12:30:17,626 INFO  L225             Difference]: With dead ends: 4720
[2024-11-02 12:30:17,627 INFO  L226             Difference]: Without dead ends: 3642
[2024-11-02 12:30:17,636 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-02 12:30:17,640 INFO  L432           NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-02 12:30:17,644 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-02 12:30:17,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3642 states.
[2024-11-02 12:30:17,911 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3642.
[2024-11-02 12:30:17,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3642 states, 3641 states have (on average 3.4509750068662455) internal successors, (12565), 3641 states have internal predecessors, (12565), 0 states have call successors, (0), 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-02 12:30:17,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 12565 transitions.
[2024-11-02 12:30:17,966 INFO  L78                 Accepts]: Start accepts. Automaton has 3642 states and 12565 transitions. Word has length 6
[2024-11-02 12:30:17,967 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 12:30:17,967 INFO  L471      AbstractCegarLoop]: Abstraction has 3642 states and 12565 transitions.
[2024-11-02 12:30:17,968 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-02 12:30:17,970 INFO  L276                IsEmpty]: Start isEmpty. Operand 3642 states and 12565 transitions.
[2024-11-02 12:30:17,977 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2024-11-02 12:30:17,977 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 12:30:17,978 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-02 12:30:17,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-02 12:30:17,981 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-02 12:30:17,982 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 12:30:17,982 INFO  L85        PathProgramCache]: Analyzing trace with hash -700598164, now seen corresponding path program 1 times
[2024-11-02 12:30:17,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2024-11-02 12:30:17,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593967948]
[2024-11-02 12:30:17,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 12:30:17,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 12:30:18,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 12:30:18,341 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-02 12:30:18,342 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2024-11-02 12:30:18,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593967948]
[2024-11-02 12:30:18,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593967948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-02 12:30:18,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-02 12:30:18,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-02 12:30:18,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185834698]
[2024-11-02 12:30:18,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-02 12:30:18,346 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-02 12:30:18,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2024-11-02 12:30:18,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-02 12:30:18,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-02 12:30:18,348 INFO  L87              Difference]: Start difference. First operand 3642 states and 12565 transitions. Second operand  has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 12:30:18,621 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 12:30:18,621 INFO  L93              Difference]: Finished difference Result 5336 states and 17972 transitions.
[2024-11-02 12:30:18,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-02 12:30:18,622 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14
[2024-11-02 12:30:18,623 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 12:30:18,650 INFO  L225             Difference]: With dead ends: 5336
[2024-11-02 12:30:18,651 INFO  L226             Difference]: Without dead ends: 2592
[2024-11-02 12:30:18,659 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-02 12:30:18,661 INFO  L432           NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-02 12:30:18,662 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 39 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-02 12:30:18,672 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2592 states.
[2024-11-02 12:30:18,755 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2592.
[2024-11-02 12:30:18,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2592 states, 2591 states have (on average 3.2284832111153996) internal successors, (8365), 2591 states have internal predecessors, (8365), 0 states have call successors, (0), 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-02 12:30:18,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 8365 transitions.
[2024-11-02 12:30:18,782 INFO  L78                 Accepts]: Start accepts. Automaton has 2592 states and 8365 transitions. Word has length 14
[2024-11-02 12:30:18,783 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 12:30:18,783 INFO  L471      AbstractCegarLoop]: Abstraction has 2592 states and 8365 transitions.
[2024-11-02 12:30:18,784 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 12:30:18,784 INFO  L276                IsEmpty]: Start isEmpty. Operand 2592 states and 8365 transitions.
[2024-11-02 12:30:18,791 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-02 12:30:18,791 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 12:30:18,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]
[2024-11-02 12:30:18,792 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-02 12:30:18,793 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-02 12:30:18,794 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 12:30:18,794 INFO  L85        PathProgramCache]: Analyzing trace with hash 72790452, now seen corresponding path program 1 times
[2024-11-02 12:30:18,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2024-11-02 12:30:18,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401217441]
[2024-11-02 12:30:18,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 12:30:18,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 12:30:19,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 12:30:19,315 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-02 12:30:19,315 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2024-11-02 12:30:19,315 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401217441]
[2024-11-02 12:30:19,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401217441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-02 12:30:19,316 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-02 12:30:19,316 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-02 12:30:19,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107030690]
[2024-11-02 12:30:19,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-02 12:30:19,317 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-02 12:30:19,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2024-11-02 12:30:19,317 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-02 12:30:19,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-02 12:30:19,318 INFO  L87              Difference]: Start difference. First operand 2592 states and 8365 transitions. Second operand  has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 12:30:19,570 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 12:30:19,571 INFO  L93              Difference]: Finished difference Result 3096 states and 9777 transitions.
[2024-11-02 12:30:19,575 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-02 12:30:19,575 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19
[2024-11-02 12:30:19,576 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 12:30:19,593 INFO  L225             Difference]: With dead ends: 3096
[2024-11-02 12:30:19,593 INFO  L226             Difference]: Without dead ends: 1402
[2024-11-02 12:30:19,598 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-02 12:30:19,599 INFO  L432           NwaCegarLoop]: 12 mSDtfsCounter, 108 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-02 12:30:19,601 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 48 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-02 12:30:19,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1402 states.
[2024-11-02 12:30:19,688 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402.
[2024-11-02 12:30:19,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1402 states, 1401 states have (on average 2.9978586723768736) internal successors, (4200), 1401 states have internal predecessors, (4200), 0 states have call successors, (0), 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-02 12:30:19,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4200 transitions.
[2024-11-02 12:30:19,704 INFO  L78                 Accepts]: Start accepts. Automaton has 1402 states and 4200 transitions. Word has length 19
[2024-11-02 12:30:19,705 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 12:30:19,705 INFO  L471      AbstractCegarLoop]: Abstraction has 1402 states and 4200 transitions.
[2024-11-02 12:30:19,705 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-02 12:30:19,705 INFO  L276                IsEmpty]: Start isEmpty. Operand 1402 states and 4200 transitions.
[2024-11-02 12:30:19,708 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-02 12:30:19,709 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 12:30:19,709 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-02 12:30:19,710 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-02 12:30:19,710 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-02 12:30:19,711 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 12:30:19,711 INFO  L85        PathProgramCache]: Analyzing trace with hash -1822569548, now seen corresponding path program 1 times
[2024-11-02 12:30:19,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2024-11-02 12:30:19,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194920253]
[2024-11-02 12:30:19,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 12:30:19,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 12:30:19,822 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 12:30:20,199 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-02 12:30:20,200 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2024-11-02 12:30:20,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194920253]
[2024-11-02 12:30:20,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194920253] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-02 12:30:20,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-02 12:30:20,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-02 12:30:20,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863450875]
[2024-11-02 12:30:20,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-02 12:30:20,201 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-02 12:30:20,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2024-11-02 12:30:20,202 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-02 12:30:20,203 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-02 12:30:20,204 INFO  L87              Difference]: Start difference. First operand 1402 states and 4200 transitions. Second operand  has 6 states, 6 states have (on average 4.0) 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-02 12:30:20,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 12:30:20,432 INFO  L93              Difference]: Finished difference Result 1458 states and 4332 transitions.
[2024-11-02 12:30:20,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-02 12:30:20,433 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 4.0) 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-02 12:30:20,433 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 12:30:20,449 INFO  L225             Difference]: With dead ends: 1458
[2024-11-02 12:30:20,450 INFO  L226             Difference]: Without dead ends: 954
[2024-11-02 12:30:20,452 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2024-11-02 12:30:20,454 INFO  L432           NwaCegarLoop]: 12 mSDtfsCounter, 123 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-02 12:30:20,458 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 39 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-02 12:30:20,461 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 954 states.
[2024-11-02 12:30:20,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954.
[2024-11-02 12:30:20,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 954 states, 953 states have (on average 2.9968520461699897) internal successors, (2856), 953 states have internal predecessors, (2856), 0 states have call successors, (0), 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-02 12:30:20,491 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 2856 transitions.
[2024-11-02 12:30:20,496 INFO  L78                 Accepts]: Start accepts. Automaton has 954 states and 2856 transitions. Word has length 24
[2024-11-02 12:30:20,497 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 12:30:20,497 INFO  L471      AbstractCegarLoop]: Abstraction has 954 states and 2856 transitions.
[2024-11-02 12:30:20,497 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 4.0) 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-02 12:30:20,497 INFO  L276                IsEmpty]: Start isEmpty. Operand 954 states and 2856 transitions.
[2024-11-02 12:30:20,500 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-02 12:30:20,500 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 12:30:20,501 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]
[2024-11-02 12:30:20,502 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-02 12:30:20,503 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-02 12:30:20,503 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 12:30:20,503 INFO  L85        PathProgramCache]: Analyzing trace with hash 22252021, now seen corresponding path program 1 times
[2024-11-02 12:30:20,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2024-11-02 12:30:20,504 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897210918]
[2024-11-02 12:30:20,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 12:30:20,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 12:30:20,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 12:30:21,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-02 12:30:21,128 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2024-11-02 12:30:21,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897210918]
[2024-11-02 12:30:21,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897210918] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-02 12:30:21,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-02 12:30:21,129 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-02 12:30:21,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169115697]
[2024-11-02 12:30:21,130 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-02 12:30:21,130 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-02 12:30:21,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2024-11-02 12:30:21,131 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-02 12:30:21,131 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-02 12:30:21,132 INFO  L87              Difference]: Start difference. First operand 954 states and 2856 transitions. Second operand  has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-02 12:30:21,412 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 12:30:21,413 INFO  L93              Difference]: Finished difference Result 1290 states and 3810 transitions.
[2024-11-02 12:30:21,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-02 12:30:21,413 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30
[2024-11-02 12:30:21,414 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 12:30:21,422 INFO  L225             Difference]: With dead ends: 1290
[2024-11-02 12:30:21,422 INFO  L226             Difference]: Without dead ends: 594
[2024-11-02 12:30:21,424 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-02 12:30:21,425 INFO  L432           NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-02 12:30:21,425 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 109 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-02 12:30:21,427 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 594 states.
[2024-11-02 12:30:21,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594.
[2024-11-02 12:30:21,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 594 states, 593 states have (on average 2.860033726812816) internal successors, (1696), 593 states have internal predecessors, (1696), 0 states have call successors, (0), 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-02 12:30:21,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1696 transitions.
[2024-11-02 12:30:21,452 INFO  L78                 Accepts]: Start accepts. Automaton has 594 states and 1696 transitions. Word has length 30
[2024-11-02 12:30:21,452 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 12:30:21,452 INFO  L471      AbstractCegarLoop]: Abstraction has 594 states and 1696 transitions.
[2024-11-02 12:30:21,453 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-02 12:30:21,453 INFO  L276                IsEmpty]: Start isEmpty. Operand 594 states and 1696 transitions.
[2024-11-02 12:30:21,455 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-02 12:30:21,455 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 12:30:21,455 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]
[2024-11-02 12:30:21,455 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-02 12:30:21,456 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-02 12:30:21,456 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 12:30:21,456 INFO  L85        PathProgramCache]: Analyzing trace with hash 996321907, now seen corresponding path program 2 times
[2024-11-02 12:30:21,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2024-11-02 12:30:21,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272306373]
[2024-11-02 12:30:21,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 12:30:21,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 12:30:21,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 12:30:21,956 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-02 12:30:21,956 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2024-11-02 12:30:21,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272306373]
[2024-11-02 12:30:21,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272306373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-02 12:30:21,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-02 12:30:21,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-02 12:30:21,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107209079]
[2024-11-02 12:30:21,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-02 12:30:21,958 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-02 12:30:21,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2024-11-02 12:30:21,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-02 12:30:21,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-02 12:30:21,961 INFO  L87              Difference]: Start difference. First operand 594 states and 1696 transitions. Second operand  has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-02 12:30:22,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 12:30:22,196 INFO  L93              Difference]: Finished difference Result 906 states and 2564 transitions.
[2024-11-02 12:30:22,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-02 12:30:22,197 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30
[2024-11-02 12:30:22,197 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 12:30:22,206 INFO  L225             Difference]: With dead ends: 906
[2024-11-02 12:30:22,207 INFO  L226             Difference]: Without dead ends: 402
[2024-11-02 12:30:22,208 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-02 12:30:22,210 INFO  L432           NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-02 12:30:22,211 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 88 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-02 12:30:22,214 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 402 states.
[2024-11-02 12:30:22,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402.
[2024-11-02 12:30:22,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 402 states, 401 states have (on average 2.718204488778055) internal successors, (1090), 401 states have internal predecessors, (1090), 0 states have call successors, (0), 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-02 12:30:22,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1090 transitions.
[2024-11-02 12:30:22,232 INFO  L78                 Accepts]: Start accepts. Automaton has 402 states and 1090 transitions. Word has length 30
[2024-11-02 12:30:22,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 12:30:22,233 INFO  L471      AbstractCegarLoop]: Abstraction has 402 states and 1090 transitions.
[2024-11-02 12:30:22,233 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-02 12:30:22,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 402 states and 1090 transitions.
[2024-11-02 12:30:22,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-02 12:30:22,235 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 12:30:22,235 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]
[2024-11-02 12:30:22,235 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-02 12:30:22,236 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-02 12:30:22,236 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 12:30:22,236 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130612325, now seen corresponding path program 3 times
[2024-11-02 12:30:22,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2024-11-02 12:30:22,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335137380]
[2024-11-02 12:30:22,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 12:30:22,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 12:30:22,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-02 12:30:24,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-02 12:30:24,021 INFO  L136   FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace
[2024-11-02 12:30:24,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335137380]
[2024-11-02 12:30:24,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335137380] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-02 12:30:24,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-02 12:30:24,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-02 12:30:24,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874429175]
[2024-11-02 12:30:24,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-02 12:30:24,022 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-02 12:30:24,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN
[2024-11-02 12:30:24,023 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-02 12:30:24,023 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-02 12:30:24,023 INFO  L87              Difference]: Start difference. First operand 402 states and 1090 transitions. Second operand  has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-02 12:30:24,398 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-02 12:30:24,398 INFO  L93              Difference]: Finished difference Result 554 states and 1486 transitions.
[2024-11-02 12:30:24,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-02 12:30:24,399 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 30
[2024-11-02 12:30:24,399 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-02 12:30:24,405 INFO  L225             Difference]: With dead ends: 554
[2024-11-02 12:30:24,405 INFO  L226             Difference]: Without dead ends: 270
[2024-11-02 12:30:24,406 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132
[2024-11-02 12:30:24,407 INFO  L432           NwaCegarLoop]: 28 mSDtfsCounter, 72 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-02 12:30:24,407 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 145 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-02 12:30:24,409 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 270 states.
[2024-11-02 12:30:24,414 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270.
[2024-11-02 12:30:24,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 270 states, 269 states have (on average 2.5353159851301115) internal successors, (682), 269 states have internal predecessors, (682), 0 states have call successors, (0), 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-02 12:30:24,416 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 682 transitions.
[2024-11-02 12:30:24,421 INFO  L78                 Accepts]: Start accepts. Automaton has 270 states and 682 transitions. Word has length 30
[2024-11-02 12:30:24,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-02 12:30:24,422 INFO  L471      AbstractCegarLoop]: Abstraction has 270 states and 682 transitions.
[2024-11-02 12:30:24,422 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-02 12:30:24,422 INFO  L276                IsEmpty]: Start isEmpty. Operand 270 states and 682 transitions.
[2024-11-02 12:30:24,423 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-02 12:30:24,423 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-02 12:30:24,423 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]
[2024-11-02 12:30:24,424 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-02 12:30:24,424 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-11-02 12:30:24,424 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-02 12:30:24,425 INFO  L85        PathProgramCache]: Analyzing trace with hash -2086596507, now seen corresponding path program 4 times
[2024-11-02 12:30:24,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN
[2024-11-02 12:30:24,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880759676]
[2024-11-02 12:30:24,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-02 12:30:24,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-02 12:30:24,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-02 12:30:24,502 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-02 12:30:24,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-02 12:30:24,627 INFO  L130   FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace
[2024-11-02 12:30:24,627 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-02 12:30:24,629 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2024-11-02 12:30:24,631 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2024-11-02 12:30:24,632 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2024-11-02 12:30:24,632 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-11-02 12:30:24,632 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-11-02 12:30:24,632 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2024-11-02 12:30:24,633 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-02 12:30:24,637 INFO  L407         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1]
[2024-11-02 12:30:24,747 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-02 12:30:24,747 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-02 12:30:24,751 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:30:24 BasicIcfg
[2024-11-02 12:30:24,751 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-02 12:30:24,752 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-02 12:30:24,752 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-02 12:30:24,752 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-02 12:30:24,753 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:16" (3/4) ...
[2024-11-02 12:30:24,754 INFO  L136         WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-02 12:30:24,873 INFO  L149         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/witness.graphml
[2024-11-02 12:30:24,874 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-02 12:30:24,874 INFO  L158              Benchmark]: Toolchain (without parser) took 10786.09ms. Allocated memory was 132.1MB in the beginning and 356.5MB in the end (delta: 224.4MB). Free memory was 101.1MB in the beginning and 99.9MB in the end (delta: 1.2MB). Peak memory consumption was 226.4MB. Max. memory is 16.1GB.
[2024-11-02 12:30:24,874 INFO  L158              Benchmark]: CDTParser took 0.27ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 90.6MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-02 12:30:24,875 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 752.57ms. Allocated memory is still 132.1MB. Free memory was 100.8MB in the beginning and 75.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-02 12:30:24,879 INFO  L158              Benchmark]: Boogie Procedure Inliner took 89.76ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 72.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-02 12:30:24,880 INFO  L158              Benchmark]: Boogie Preprocessor took 65.71ms. Allocated memory is still 132.1MB. Free memory was 72.7MB in the beginning and 70.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-02 12:30:24,880 INFO  L158              Benchmark]: RCFGBuilder took 1020.96ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 70.7MB in the beginning and 90.7MB in the end (delta: -20.0MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB.
[2024-11-02 12:30:24,880 INFO  L158              Benchmark]: TraceAbstraction took 8724.22ms. Allocated memory was 161.5MB in the beginning and 356.5MB in the end (delta: 195.0MB). Free memory was 90.0MB in the beginning and 112.4MB in the end (delta: -22.4MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB.
[2024-11-02 12:30:24,881 INFO  L158              Benchmark]: Witness Printer took 121.93ms. Allocated memory is still 356.5MB. Free memory was 112.4MB in the beginning and 99.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-02 12:30:24,882 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.27ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 90.6MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 752.57ms. Allocated memory is still 132.1MB. Free memory was 100.8MB in the beginning and 75.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 89.76ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 72.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 65.71ms. Allocated memory is still 132.1MB. Free memory was 72.7MB in the beginning and 70.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1020.96ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 70.7MB in the beginning and 90.7MB in the end (delta: -20.0MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8724.22ms. Allocated memory was 161.5MB in the beginning and 356.5MB in the end (delta: 195.0MB). Free memory was 90.0MB in the beginning and 112.4MB in the end (delta: -22.4MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB.
 * Witness Printer took 121.93ms. Allocated memory is still 356.5MB. Free memory was 112.4MB in the beginning and 99.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p1_EAX = 0;
[L716]               0  int __unbuffered_p2_EAX = 0;
[L718]               0  int __unbuffered_p2_EBX = 0;
[L719]               0  _Bool main$tmp_guard0;
[L720]               0  _Bool main$tmp_guard1;
[L722]               0  int x = 0;
[L723]               0  _Bool x$flush_delayed;
[L724]               0  int x$mem_tmp;
[L725]               0  _Bool x$r_buff0_thd0;
[L726]               0  _Bool x$r_buff0_thd1;
[L727]               0  _Bool x$r_buff0_thd2;
[L728]               0  _Bool x$r_buff0_thd3;
[L729]               0  _Bool x$r_buff1_thd0;
[L730]               0  _Bool x$r_buff1_thd1;
[L731]               0  _Bool x$r_buff1_thd2;
[L732]               0  _Bool x$r_buff1_thd3;
[L733]               0  _Bool x$read_delayed;
[L734]               0  int *x$read_delayed_var;
[L735]               0  int x$w_buff0;
[L736]               0  _Bool x$w_buff0_used;
[L737]               0  int x$w_buff1;
[L738]               0  _Bool x$w_buff1_used;
[L740]               0  int y = 0;
[L742]               0  int z = 0;
[L743]               0  _Bool weak$$choice0;
[L744]               0  _Bool weak$$choice2;
[L836]               0  pthread_t t412;
[L837]  FCALL, FORK  0  pthread_create(&t412, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t412=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L838]               0  pthread_t t413;
[L839]  FCALL, FORK  0  pthread_create(&t413, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t412=-2, t413=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L776]               2  x$w_buff1 = x$w_buff0
[L777]               2  x$w_buff0 = 1
[L778]               2  x$w_buff1_used = x$w_buff0_used
[L779]               2  x$w_buff0_used = (_Bool)1
[L780]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L780]  RET          2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L781]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L782]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L783]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L784]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L785]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L840]               0  pthread_t t414;
[L841]  FCALL, FORK  0  pthread_create(&t414, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t412=-2, t413=-1, t414=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L788]               2  __unbuffered_p1_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L805]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L808]               3  __unbuffered_p2_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L811]               3  __unbuffered_p2_EBX = z
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L748]               1  z = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L814]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L815]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L816]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L817]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L818]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L751]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L752]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L753]               1  x$flush_delayed = weak$$choice2
[L754]               1  x$mem_tmp = x
[L755]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L756]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L757]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L758]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L759]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L760]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L761]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762]               1  __unbuffered_p0_EAX = x
[L763]               1  x = x$flush_delayed ? x$mem_tmp : x
[L764]               1  x$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L791]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L792]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L793]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L794]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L795]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L798]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L821]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L769]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L843]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412=-2, t413=-1, t414=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L845]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L845]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L847]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L848]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L849]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L850]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L851]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412=-2, t413=-1, t414=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L854]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t412=-2, t413=-1, t414=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L856]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]
[L19]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1]

  - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 369 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 694 IncrementalHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 131 mSDtfsCounter, 694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4496occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 proved your program to be incorrect!
[2024-11-02 12:30:24,922 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac03397f-5c89-4996-a982-4e911501f832/bin/utaipan-verify-DbMuA5NWw2/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
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE